./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.4_2.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.4_2.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 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:16:53,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:16:53,195 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:53,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:16:53,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:16:53,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:16:53,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:16:53,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:16:53,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:16:53,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:16:53,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:16:53,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:16:53,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:16:53,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:16:53,225 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:16:53,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:16:53,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:16:53,226 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:16:53,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:16:53,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:16:53,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:16:53,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:16:53,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:16:53,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:16:53,229 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:16:53,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:16:53,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:16:53,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:16:53,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:16:53,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:16:53,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:16:53,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:16:53,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:16:53,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:16:53,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:16:53,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:16:53,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:16:53,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:16:53,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:16:53,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:16:53,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:16:53,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:16:53,233 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 -> 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f [2024-10-11 03:16:53,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:16:53,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:16:53,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:16:53,446 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:16:53,446 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:16:53,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-10-11 03:16:54,678 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:16:54,861 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:16:54,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-10-11 03:16:54,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e3df6fc1/5c5605061a434157a3a4e94cc269f0a7/FLAGc073438da [2024-10-11 03:16:54,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e3df6fc1/5c5605061a434157a3a4e94cc269f0a7 [2024-10-11 03:16:54,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:16:54,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:16:54,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:16:54,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:16:54,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:16:54,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:16:54" (1/1) ... [2024-10-11 03:16:54,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5293e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:54, skipping insertion in model container [2024-10-11 03:16:54,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:16:54" (1/1) ... [2024-10-11 03:16:54,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:16:55,182 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.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-10-11 03:16:55,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:16:55,199 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:16:55,239 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.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-10-11 03:16:55,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:16:55,259 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:16:55,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55 WrapperNode [2024-10-11 03:16:55,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:16:55,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:16:55,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:16:55,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:16:55,266 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:16:55" (1/1) ... [2024-10-11 03:16:55,281 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:16:55" (1/1) ... [2024-10-11 03:16:55,317 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 507 [2024-10-11 03:16:55,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:16:55,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:16:55,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:16:55,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:16:55,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55" (1/1) ... [2024-10-11 03:16:55,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55" (1/1) ... [2024-10-11 03:16:55,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55" (1/1) ... [2024-10-11 03:16:55,352 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:16:55,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55" (1/1) ... [2024-10-11 03:16:55,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55" (1/1) ... [2024-10-11 03:16:55,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55" (1/1) ... [2024-10-11 03:16:55,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55" (1/1) ... [2024-10-11 03:16:55,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55" (1/1) ... [2024-10-11 03:16:55,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55" (1/1) ... [2024-10-11 03:16:55,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:16:55,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:16:55,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:16:55,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:16:55,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55" (1/1) ... [2024-10-11 03:16:55,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:16:55,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:16:55,410 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:16:55,413 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:16:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-11 03:16:55,449 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-11 03:16:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:16:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-11 03:16:55,450 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-11 03:16:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-11 03:16:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-11 03:16:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-11 03:16:55,452 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-11 03:16:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 03:16:55,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 03:16:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:16:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-11 03:16:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-11 03:16:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:16:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:16:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-11 03:16:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-11 03:16:55,552 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:16:55,553 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:16:56,090 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-10-11 03:16:56,090 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:16:56,171 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:16:56,172 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:16:56,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:16:56 BoogieIcfgContainer [2024-10-11 03:16:56,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:16:56,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:16:56,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:16:56,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:16:56,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:16:54" (1/3) ... [2024-10-11 03:16:56,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3c4beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:16:56, skipping insertion in model container [2024-10-11 03:16:56,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:16:55" (2/3) ... [2024-10-11 03:16:56,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3c4beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:16:56, skipping insertion in model container [2024-10-11 03:16:56,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:16:56" (3/3) ... [2024-10-11 03:16:56,179 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-10-11 03:16:56,192 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:16:56,192 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:16:56,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:16:56,259 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;@310af2f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:16:56,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:16:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 130 states have (on average 1.6) internal successors, (208), 132 states have internal predecessors, (208), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:16:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:16:56,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:56,273 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:16:56,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:56,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash 975176766, now seen corresponding path program 1 times [2024-10-11 03:16:56,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:56,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470675276] [2024-10-11 03:16:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:56,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:16:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:56,509 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:16:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470675276] [2024-10-11 03:16:56,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470675276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:56,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:56,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:16:56,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908435933] [2024-10-11 03:16:56,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:56,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:16:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:56,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:16:56,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:16:56,541 INFO L87 Difference]: Start difference. First operand has 170 states, 130 states have (on average 1.6) internal successors, (208), 132 states have internal predecessors, (208), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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:16:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:56,599 INFO L93 Difference]: Finished difference Result 323 states and 540 transitions. [2024-10-11 03:16:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:16:56,602 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:16:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:56,609 INFO L225 Difference]: With dead ends: 323 [2024-10-11 03:16:56,610 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 03:16:56,614 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:16:56,617 INFO L432 NwaCegarLoop]: 260 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, 260 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:16:56,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:16:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 03:16:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-11 03:16:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.573643410852713) internal successors, (203), 130 states have internal predecessors, (203), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:16:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 265 transitions. [2024-10-11 03:16:56,666 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 265 transitions. Word has length 23 [2024-10-11 03:16:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:56,666 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 265 transitions. [2024-10-11 03:16:56,667 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:16:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 265 transitions. [2024-10-11 03:16:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:16:56,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:56,670 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:16:56,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:16:56,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:56,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1018967940, now seen corresponding path program 1 times [2024-10-11 03:16:56,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:56,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405305787] [2024-10-11 03:16:56,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:56,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:16:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:56,877 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:16:56,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:56,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405305787] [2024-10-11 03:16:56,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405305787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:56,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:56,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:16:56,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914979364] [2024-10-11 03:16:56,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:56,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:16:56,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:56,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:16:56,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:16:56,882 INFO L87 Difference]: Start difference. First operand 168 states and 265 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:16:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:57,003 INFO L93 Difference]: Finished difference Result 323 states and 505 transitions. [2024-10-11 03:16:57,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:16:57,006 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:16:57,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:57,007 INFO L225 Difference]: With dead ends: 323 [2024-10-11 03:16:57,007 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 03:16:57,008 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:16:57,012 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1260 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:16:57,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1260 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:16:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 03:16:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-11 03:16:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 130 states have internal predecessors, (191), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:16:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2024-10-11 03:16:57,043 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 23 [2024-10-11 03:16:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:57,043 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2024-10-11 03:16:57,044 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:16:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2024-10-11 03:16:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:16:57,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:57,045 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:16:57,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:16:57,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:57,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash 26280683, now seen corresponding path program 1 times [2024-10-11 03:16:57,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254879287] [2024-10-11 03:16:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:57,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,250 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:16:57,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:57,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254879287] [2024-10-11 03:16:57,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254879287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:57,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:57,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:16:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426769123] [2024-10-11 03:16:57,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:57,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:16:57,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:57,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:16:57,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:16:57,256 INFO L87 Difference]: Start difference. First operand 168 states and 253 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:16:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:57,326 INFO L93 Difference]: Finished difference Result 324 states and 497 transitions. [2024-10-11 03:16:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:16:57,327 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:16:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:57,328 INFO L225 Difference]: With dead ends: 324 [2024-10-11 03:16:57,330 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 03:16:57,331 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:16:57,332 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 3 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 716 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:57,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 716 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:16:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 03:16:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-10-11 03:16:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.4696969696969697) internal successors, (194), 133 states have internal predecessors, (194), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:16:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2024-10-11 03:16:57,343 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 34 [2024-10-11 03:16:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:57,343 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2024-10-11 03:16:57,343 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:16:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2024-10-11 03:16:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:16:57,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:57,345 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:16:57,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:16:57,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:57,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:57,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1285077620, now seen corresponding path program 1 times [2024-10-11 03:16:57,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:57,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343785579] [2024-10-11 03:16:57,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:57,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:16:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:16:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,428 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:16:57,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343785579] [2024-10-11 03:16:57,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343785579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:57,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:57,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:16:57,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325438239] [2024-10-11 03:16:57,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:57,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:16:57,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:16:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:16:57,432 INFO L87 Difference]: Start difference. First operand 172 states and 256 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:16:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:57,479 INFO L93 Difference]: Finished difference Result 473 states and 714 transitions. [2024-10-11 03:16:57,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:16:57,480 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:16:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:57,482 INFO L225 Difference]: With dead ends: 473 [2024-10-11 03:16:57,482 INFO L226 Difference]: Without dead ends: 317 [2024-10-11 03:16:57,483 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:16:57,486 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 209 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 495 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:16:57,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 495 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:16:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-11 03:16:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2024-10-11 03:16:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 237 states have (on average 1.4852320675105486) internal successors, (352), 239 states have internal predecessors, (352), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 03:16:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 472 transitions. [2024-10-11 03:16:57,535 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 472 transitions. Word has length 48 [2024-10-11 03:16:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:57,535 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 472 transitions. [2024-10-11 03:16:57,535 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:16:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 472 transitions. [2024-10-11 03:16:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:16:57,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:57,537 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:16:57,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:16:57,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:57,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:57,538 INFO L85 PathProgramCache]: Analyzing trace with hash -271052700, now seen corresponding path program 1 times [2024-10-11 03:16:57,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:57,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201147729] [2024-10-11 03:16:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:57,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:16:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:16:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,607 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:16:57,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:57,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201147729] [2024-10-11 03:16:57,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201147729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:57,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:57,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:16:57,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160185472] [2024-10-11 03:16:57,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:57,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:16:57,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:57,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:16:57,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:16:57,609 INFO L87 Difference]: Start difference. First operand 314 states and 472 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:16:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:57,674 INFO L93 Difference]: Finished difference Result 886 states and 1342 transitions. [2024-10-11 03:16:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:16:57,674 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:16:57,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:57,680 INFO L225 Difference]: With dead ends: 886 [2024-10-11 03:16:57,680 INFO L226 Difference]: Without dead ends: 588 [2024-10-11 03:16:57,681 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:16:57,682 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 210 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:57,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 515 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:16:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-11 03:16:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 582. [2024-10-11 03:16:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 433 states have (on average 1.4942263279445727) internal successors, (647), 437 states have internal predecessors, (647), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-11 03:16:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 881 transitions. [2024-10-11 03:16:57,727 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 881 transitions. Word has length 49 [2024-10-11 03:16:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:57,729 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 881 transitions. [2024-10-11 03:16:57,730 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:16:57,731 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 881 transitions. [2024-10-11 03:16:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:16:57,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:57,735 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:16:57,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:16:57,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:57,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1550916378, now seen corresponding path program 1 times [2024-10-11 03:16:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:57,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215651371] [2024-10-11 03:16:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:57,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:16:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:16:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:57,842 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:16:57,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:57,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215651371] [2024-10-11 03:16:57,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215651371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:57,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:57,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:16:57,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172171460] [2024-10-11 03:16:57,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:57,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:16:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:57,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:16:57,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:16:57,844 INFO L87 Difference]: Start difference. First operand 582 states and 881 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:16:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:58,013 INFO L93 Difference]: Finished difference Result 1237 states and 1874 transitions. [2024-10-11 03:16:58,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:16:58,014 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:16:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:58,020 INFO L225 Difference]: With dead ends: 1237 [2024-10-11 03:16:58,020 INFO L226 Difference]: Without dead ends: 671 [2024-10-11 03:16:58,022 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:16:58,022 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 347 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:58,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 645 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:16:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-11 03:16:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 663. [2024-10-11 03:16:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 501 states have (on average 1.4810379241516967) internal successors, (742), 504 states have internal predecessors, (742), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:16:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 990 transitions. [2024-10-11 03:16:58,069 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 990 transitions. Word has length 49 [2024-10-11 03:16:58,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:58,070 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 990 transitions. [2024-10-11 03:16:58,070 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:16:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 990 transitions. [2024-10-11 03:16:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:16:58,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:58,074 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:16:58,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:16:58,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:58,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1743107091, now seen corresponding path program 1 times [2024-10-11 03:16:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:58,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829746383] [2024-10-11 03:16:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:16:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:16:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,184 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:16:58,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:58,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829746383] [2024-10-11 03:16:58,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829746383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:58,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:58,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:16:58,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297211823] [2024-10-11 03:16:58,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:58,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:16:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:16:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:16:58,186 INFO L87 Difference]: Start difference. First operand 663 states and 990 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:16:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:58,328 INFO L93 Difference]: Finished difference Result 1241 states and 1874 transitions. [2024-10-11 03:16:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:16:58,328 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:16:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:58,332 INFO L225 Difference]: With dead ends: 1241 [2024-10-11 03:16:58,332 INFO L226 Difference]: Without dead ends: 675 [2024-10-11 03:16:58,334 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:16:58,334 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 347 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:58,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 645 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:16:58,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-11 03:16:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 671. [2024-10-11 03:16:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 509 states have (on average 1.4734774066797642) internal successors, (750), 512 states have internal predecessors, (750), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:16:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 998 transitions. [2024-10-11 03:16:58,370 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 998 transitions. Word has length 50 [2024-10-11 03:16:58,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:58,370 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 998 transitions. [2024-10-11 03:16:58,371 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:16:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 998 transitions. [2024-10-11 03:16:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:16:58,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:58,372 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:16:58,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:16:58,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:58,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1020972895, now seen corresponding path program 1 times [2024-10-11 03:16:58,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57262518] [2024-10-11 03:16:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:16:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:16:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,505 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:16:58,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:58,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57262518] [2024-10-11 03:16:58,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57262518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:58,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:58,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:16:58,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335577232] [2024-10-11 03:16:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:58,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:16:58,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:58,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:16:58,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:16:58,507 INFO L87 Difference]: Start difference. First operand 671 states and 998 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:16:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:58,636 INFO L93 Difference]: Finished difference Result 1237 states and 1862 transitions. [2024-10-11 03:16:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:16:58,637 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:16:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:58,642 INFO L225 Difference]: With dead ends: 1237 [2024-10-11 03:16:58,643 INFO L226 Difference]: Without dead ends: 671 [2024-10-11 03:16:58,644 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:16:58,646 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 58 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:16:58,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 640 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:16:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-11 03:16:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2024-10-11 03:16:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 509 states have (on average 1.4656188605108056) internal successors, (746), 512 states have internal predecessors, (746), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:16:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 994 transitions. [2024-10-11 03:16:58,689 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 994 transitions. Word has length 52 [2024-10-11 03:16:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:58,689 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 994 transitions. [2024-10-11 03:16:58,690 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:16:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 994 transitions. [2024-10-11 03:16:58,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:16:58,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:58,690 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:16:58,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:16:58,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:58,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash 70077876, now seen corresponding path program 1 times [2024-10-11 03:16:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:58,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093751437] [2024-10-11 03:16:58,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:58,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:16:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:16:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:58,865 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:16:58,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:58,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093751437] [2024-10-11 03:16:58,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093751437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:58,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:58,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:16:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729220733] [2024-10-11 03:16:58,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:58,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:16:58,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:58,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:16:58,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:16:58,867 INFO L87 Difference]: Start difference. First operand 671 states and 994 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:16:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:58,944 INFO L93 Difference]: Finished difference Result 1257 states and 1886 transitions. [2024-10-11 03:16:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:16:58,945 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:16:58,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:58,949 INFO L225 Difference]: With dead ends: 1257 [2024-10-11 03:16:58,949 INFO L226 Difference]: Without dead ends: 691 [2024-10-11 03:16:58,951 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:16:58,951 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 4 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 728 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:16:58,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 728 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:16:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-11 03:16:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2024-10-11 03:16:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 525 states have (on average 1.4514285714285715) internal successors, (762), 528 states have internal predecessors, (762), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:16:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1010 transitions. [2024-10-11 03:16:58,988 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1010 transitions. Word has length 53 [2024-10-11 03:16:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:58,988 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1010 transitions. [2024-10-11 03:16:58,988 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:16:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1010 transitions. [2024-10-11 03:16:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:16:58,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:58,989 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:16:58,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:16:58,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:58,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2022849498, now seen corresponding path program 1 times [2024-10-11 03:16:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111926911] [2024-10-11 03:16:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:58,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:16:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:16:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:16:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,120 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:16:59,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:59,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111926911] [2024-10-11 03:16:59,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111926911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:59,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:59,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:16:59,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301086712] [2024-10-11 03:16:59,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:59,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:16:59,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:59,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:16:59,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:16:59,122 INFO L87 Difference]: Start difference. First operand 691 states and 1010 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:16:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:59,202 INFO L93 Difference]: Finished difference Result 1297 states and 1930 transitions. [2024-10-11 03:16:59,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:16:59,203 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:16:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:59,206 INFO L225 Difference]: With dead ends: 1297 [2024-10-11 03:16:59,206 INFO L226 Difference]: Without dead ends: 711 [2024-10-11 03:16:59,208 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:16:59,208 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 714 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:16:59,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 714 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:16:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-11 03:16:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2024-10-11 03:16:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 541 states have (on average 1.4380776340110906) internal successors, (778), 544 states have internal predecessors, (778), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:16:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1026 transitions. [2024-10-11 03:16:59,244 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1026 transitions. Word has length 61 [2024-10-11 03:16:59,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:59,244 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1026 transitions. [2024-10-11 03:16:59,244 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:16:59,244 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1026 transitions. [2024-10-11 03:16:59,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:16:59,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:59,245 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:16:59,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:16:59,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:59,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1319245148, now seen corresponding path program 1 times [2024-10-11 03:16:59,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:59,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037045945] [2024-10-11 03:16:59,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:59,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:16:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:16:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:16:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:16:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,377 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:16:59,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:59,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037045945] [2024-10-11 03:16:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037045945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:59,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:59,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:16:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156291015] [2024-10-11 03:16:59,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:59,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:16:59,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:59,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:16:59,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:16:59,379 INFO L87 Difference]: Start difference. First operand 711 states and 1026 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:16:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:59,449 INFO L93 Difference]: Finished difference Result 1333 states and 1946 transitions. [2024-10-11 03:16:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:16:59,449 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:16:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:59,454 INFO L225 Difference]: With dead ends: 1333 [2024-10-11 03:16:59,454 INFO L226 Difference]: Without dead ends: 727 [2024-10-11 03:16:59,455 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:16:59,456 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 3 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 724 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:16:59,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 724 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:16:59,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-11 03:16:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2024-10-11 03:16:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 553 states have (on average 1.4285714285714286) internal successors, (790), 556 states have internal predecessors, (790), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:16:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1038 transitions. [2024-10-11 03:16:59,487 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1038 transitions. Word has length 69 [2024-10-11 03:16:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:59,487 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1038 transitions. [2024-10-11 03:16:59,488 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:16:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1038 transitions. [2024-10-11 03:16:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:16:59,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:59,489 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:16:59,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:16:59,489 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:59,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:59,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1077214155, now seen corresponding path program 1 times [2024-10-11 03:16:59,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:59,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442143774] [2024-10-11 03:16:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:16:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:16:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:16:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:16:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,621 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:16:59,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:59,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442143774] [2024-10-11 03:16:59,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442143774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:59,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:59,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:16:59,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740576313] [2024-10-11 03:16:59,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:59,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:16:59,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:59,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:16:59,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:16:59,623 INFO L87 Difference]: Start difference. First operand 727 states and 1038 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:16:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:59,694 INFO L93 Difference]: Finished difference Result 1369 states and 1986 transitions. [2024-10-11 03:16:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:16:59,695 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:16:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:59,699 INFO L225 Difference]: With dead ends: 1369 [2024-10-11 03:16:59,699 INFO L226 Difference]: Without dead ends: 747 [2024-10-11 03:16:59,701 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:16:59,701 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 714 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:16:59,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 714 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:16:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-10-11 03:16:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2024-10-11 03:16:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 569 states have (on average 1.4165202108963093) internal successors, (806), 572 states have internal predecessors, (806), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:16:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1054 transitions. [2024-10-11 03:16:59,739 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1054 transitions. Word has length 69 [2024-10-11 03:16:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:16:59,739 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1054 transitions. [2024-10-11 03:16:59,739 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:16:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1054 transitions. [2024-10-11 03:16:59,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:16:59,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:16:59,742 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:16:59,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:16:59,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:16:59,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:16:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 371503403, now seen corresponding path program 1 times [2024-10-11 03:16:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:16:59,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935991554] [2024-10-11 03:16:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:16:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:16:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:16:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:16:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:16:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:16:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:16:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:16:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:16:59,926 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:16:59,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:16:59,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935991554] [2024-10-11 03:16:59,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935991554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:16:59,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:16:59,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:16:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866144241] [2024-10-11 03:16:59,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:16:59,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:16:59,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:16:59,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:16:59,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:16:59,929 INFO L87 Difference]: Start difference. First operand 747 states and 1054 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:16:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:16:59,994 INFO L93 Difference]: Finished difference Result 1413 states and 2014 transitions. [2024-10-11 03:16:59,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:16:59,994 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:16:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:16:59,998 INFO L225 Difference]: With dead ends: 1413 [2024-10-11 03:16:59,998 INFO L226 Difference]: Without dead ends: 771 [2024-10-11 03:16:59,999 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:00,000 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 5 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 726 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:00,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 726 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:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-11 03:17:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2024-10-11 03:17:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 589 states have (on average 1.4023769100169778) internal successors, (826), 592 states have internal predecessors, (826), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1074 transitions. [2024-10-11 03:17:00,044 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1074 transitions. Word has length 77 [2024-10-11 03:17:00,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:00,044 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1074 transitions. [2024-10-11 03:17:00,044 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:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1074 transitions. [2024-10-11 03:17:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:17:00,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:00,046 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:00,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:17:00,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:00,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:00,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1261624674, now seen corresponding path program 1 times [2024-10-11 03:17:00,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:00,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295295205] [2024-10-11 03:17:00,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:00,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,460 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:00,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:00,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295295205] [2024-10-11 03:17:00,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295295205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:00,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:00,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:00,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514733368] [2024-10-11 03:17:00,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:00,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:00,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:00,462 INFO L87 Difference]: Start difference. First operand 771 states and 1074 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:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:00,710 INFO L93 Difference]: Finished difference Result 1995 states and 2765 transitions. [2024-10-11 03:17:00,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:00,710 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:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:00,716 INFO L225 Difference]: With dead ends: 1995 [2024-10-11 03:17:00,716 INFO L226 Difference]: Without dead ends: 1329 [2024-10-11 03:17:00,718 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:00,718 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 193 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:00,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1404 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2024-10-11 03:17:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1047. [2024-10-11 03:17:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 792 states have (on average 1.3888888888888888) internal successors, (1100), 797 states have internal predecessors, (1100), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-11 03:17:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1444 transitions. [2024-10-11 03:17:00,777 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1444 transitions. Word has length 80 [2024-10-11 03:17:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:00,777 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1444 transitions. [2024-10-11 03:17:00,777 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:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1444 transitions. [2024-10-11 03:17:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 03:17:00,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:00,778 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:00,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:17:00,779 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:00,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash 203336820, now seen corresponding path program 1 times [2024-10-11 03:17:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:00,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171328006] [2024-10-11 03:17:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:17:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:00,882 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:00,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171328006] [2024-10-11 03:17:00,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171328006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:00,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:00,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:00,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399316448] [2024-10-11 03:17:00,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:00,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:00,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:00,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:00,884 INFO L87 Difference]: Start difference. First operand 1047 states and 1444 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:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:00,970 INFO L93 Difference]: Finished difference Result 1953 states and 2714 transitions. [2024-10-11 03:17:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:00,970 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:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:00,975 INFO L225 Difference]: With dead ends: 1953 [2024-10-11 03:17:00,975 INFO L226 Difference]: Without dead ends: 1071 [2024-10-11 03:17:00,978 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:00,979 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 3 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 724 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:00,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 724 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:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-11 03:17:01,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2024-10-11 03:17:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 810 states have (on average 1.3802469135802469) internal successors, (1118), 815 states have internal predecessors, (1118), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-11 03:17:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1462 transitions. [2024-10-11 03:17:01,068 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1462 transitions. Word has length 84 [2024-10-11 03:17:01,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:01,068 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1462 transitions. [2024-10-11 03:17:01,068 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:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1462 transitions. [2024-10-11 03:17:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 03:17:01,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:01,069 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:01,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:17:01,069 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:01,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:01,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1117244196, now seen corresponding path program 1 times [2024-10-11 03:17:01,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:01,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650764748] [2024-10-11 03:17:01,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:01,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,284 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:01,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:01,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650764748] [2024-10-11 03:17:01,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650764748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:01,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:01,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:17:01,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500559067] [2024-10-11 03:17:01,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:01,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:17:01,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:01,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:17:01,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:17:01,286 INFO L87 Difference]: Start difference. First operand 1071 states and 1462 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:17:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:01,489 INFO L93 Difference]: Finished difference Result 1485 states and 2136 transitions. [2024-10-11 03:17:01,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:01,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2024-10-11 03:17:01,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:01,496 INFO L225 Difference]: With dead ends: 1485 [2024-10-11 03:17:01,496 INFO L226 Difference]: Without dead ends: 1483 [2024-10-11 03:17:01,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:17:01,497 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 259 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:01,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 2482 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-10-11 03:17:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1079. [2024-10-11 03:17:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 814 states have (on average 1.3783783783783783) internal successors, (1122), 821 states have internal predecessors, (1122), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-11 03:17:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1470 transitions. [2024-10-11 03:17:01,561 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1470 transitions. Word has length 83 [2024-10-11 03:17:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:01,561 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1470 transitions. [2024-10-11 03:17:01,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:17:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1470 transitions. [2024-10-11 03:17:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 03:17:01,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:01,562 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:01,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:17:01,563 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:01,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1786856787, now seen corresponding path program 1 times [2024-10-11 03:17:01,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:01,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522793258] [2024-10-11 03:17:01,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:01,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,688 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:01,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:01,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522793258] [2024-10-11 03:17:01,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522793258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:01,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:01,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:01,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119475245] [2024-10-11 03:17:01,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:01,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:01,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:01,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:01,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:01,690 INFO L87 Difference]: Start difference. First operand 1079 states and 1470 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:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:01,881 INFO L93 Difference]: Finished difference Result 1945 states and 2661 transitions. [2024-10-11 03:17:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:01,881 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:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:01,887 INFO L225 Difference]: With dead ends: 1945 [2024-10-11 03:17:01,887 INFO L226 Difference]: Without dead ends: 1113 [2024-10-11 03:17:01,889 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:01,889 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 244 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:01,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1421 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-10-11 03:17:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1071. [2024-10-11 03:17:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 817 states have (on average 1.3733170134638923) internal successors, (1122), 829 states have internal predecessors, (1122), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2024-10-11 03:17:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1446 transitions. [2024-10-11 03:17:01,975 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1446 transitions. Word has length 86 [2024-10-11 03:17:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:01,975 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1446 transitions. [2024-10-11 03:17:01,975 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:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1446 transitions. [2024-10-11 03:17:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 03:17:01,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:01,977 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:01,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:17:01,977 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:01,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash 116448996, now seen corresponding path program 1 times [2024-10-11 03:17:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995886921] [2024-10-11 03:17:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 03:17:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,353 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:02,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:02,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995886921] [2024-10-11 03:17:02,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995886921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:02,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:02,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:02,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388775310] [2024-10-11 03:17:02,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:02,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:02,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:02,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:02,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:02,355 INFO L87 Difference]: Start difference. First operand 1071 states and 1446 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:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:02,546 INFO L93 Difference]: Finished difference Result 1911 states and 2591 transitions. [2024-10-11 03:17:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:02,547 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:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:02,552 INFO L225 Difference]: With dead ends: 1911 [2024-10-11 03:17:02,552 INFO L226 Difference]: Without dead ends: 1067 [2024-10-11 03:17:02,554 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:02,554 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 145 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:02,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1513 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-10-11 03:17:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 964. [2024-10-11 03:17:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 737 states have (on average 1.3772048846675713) internal successors, (1015), 747 states have internal predecessors, (1015), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-11 03:17:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1305 transitions. [2024-10-11 03:17:02,605 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1305 transitions. Word has length 88 [2024-10-11 03:17:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:02,605 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1305 transitions. [2024-10-11 03:17:02,605 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:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1305 transitions. [2024-10-11 03:17:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:17:02,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:02,606 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:02,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:17:02,606 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:02,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:02,607 INFO L85 PathProgramCache]: Analyzing trace with hash -741171965, now seen corresponding path program 1 times [2024-10-11 03:17:02,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:02,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433034928] [2024-10-11 03:17:02,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:17:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:17:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,971 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:02,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:02,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433034928] [2024-10-11 03:17:02,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433034928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:02,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:02,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:17:02,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154794064] [2024-10-11 03:17:02,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:02,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:17:02,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:02,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:17:02,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:17:02,973 INFO L87 Difference]: Start difference. First operand 964 states and 1305 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:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:03,383 INFO L93 Difference]: Finished difference Result 1859 states and 2511 transitions. [2024-10-11 03:17:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:03,384 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:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:03,389 INFO L225 Difference]: With dead ends: 1859 [2024-10-11 03:17:03,389 INFO L226 Difference]: Without dead ends: 1051 [2024-10-11 03:17:03,390 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:03,391 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 659 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:03,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1351 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:17:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-11 03:17:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1002. [2024-10-11 03:17:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 760 states have (on average 1.3539473684210526) internal successors, (1029), 771 states have internal predecessors, (1029), 154 states have call successors, (154), 87 states have call predecessors, (154), 87 states have return successors, (154), 143 states have call predecessors, (154), 154 states have call successors, (154) [2024-10-11 03:17:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1337 transitions. [2024-10-11 03:17:03,478 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1337 transitions. Word has length 89 [2024-10-11 03:17:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:03,478 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1337 transitions. [2024-10-11 03:17:03,478 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:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1337 transitions. [2024-10-11 03:17:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:17:03,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:03,479 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:03,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:17:03,480 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:03,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1765724356, now seen corresponding path program 1 times [2024-10-11 03:17:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:03,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66929845] [2024-10-11 03:17:03,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 03:17:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 03:17:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,894 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:03,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:03,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66929845] [2024-10-11 03:17:03,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66929845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:03,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:03,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:17:03,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126965231] [2024-10-11 03:17:03,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:03,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:17:03,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:03,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:17:03,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:17:03,896 INFO L87 Difference]: Start difference. First operand 1002 states and 1337 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:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:04,397 INFO L93 Difference]: Finished difference Result 1942 states and 2575 transitions. [2024-10-11 03:17:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:04,398 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:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:04,403 INFO L225 Difference]: With dead ends: 1942 [2024-10-11 03:17:04,404 INFO L226 Difference]: Without dead ends: 1109 [2024-10-11 03:17:04,406 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:04,407 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 520 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:04,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1339 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:17:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-10-11 03:17:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1024. [2024-10-11 03:17:04,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 774 states have (on average 1.3372093023255813) internal successors, (1035), 786 states have internal predecessors, (1035), 157 states have call successors, (157), 92 states have call predecessors, (157), 92 states have return successors, (157), 145 states have call predecessors, (157), 157 states have call successors, (157) [2024-10-11 03:17:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1349 transitions. [2024-10-11 03:17:04,494 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1349 transitions. Word has length 91 [2024-10-11 03:17:04,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:04,495 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1349 transitions. [2024-10-11 03:17:04,495 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:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1349 transitions. [2024-10-11 03:17:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:17:04,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:04,496 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:04,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:17:04,496 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:04,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:04,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1782988361, now seen corresponding path program 1 times [2024-10-11 03:17:04,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:04,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261899580] [2024-10-11 03:17:04,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:04,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:17:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,581 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:04,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:04,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261899580] [2024-10-11 03:17:04,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261899580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:04,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:04,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:04,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140438320] [2024-10-11 03:17:04,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:04,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:04,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:04,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:04,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:04,583 INFO L87 Difference]: Start difference. First operand 1024 states and 1349 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:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:04,788 INFO L93 Difference]: Finished difference Result 2682 states and 3557 transitions. [2024-10-11 03:17:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:04,788 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:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:04,796 INFO L225 Difference]: With dead ends: 2682 [2024-10-11 03:17:04,796 INFO L226 Difference]: Without dead ends: 1905 [2024-10-11 03:17:04,798 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:04,798 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 195 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1096 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:04,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1096 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2024-10-11 03:17:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1734. [2024-10-11 03:17:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1296 states have (on average 1.3356481481481481) internal successors, (1731), 1316 states have internal predecessors, (1731), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2024-10-11 03:17:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2291 transitions. [2024-10-11 03:17:04,940 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2291 transitions. Word has length 92 [2024-10-11 03:17:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:04,941 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2291 transitions. [2024-10-11 03:17:04,941 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:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2291 transitions. [2024-10-11 03:17:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:17:04,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:04,942 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:04,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:17:04,942 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:04,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash 890629356, now seen corresponding path program 1 times [2024-10-11 03:17:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:04,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092695991] [2024-10-11 03:17:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:17:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,023 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:05,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:05,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092695991] [2024-10-11 03:17:05,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092695991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:05,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:05,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:05,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016745556] [2024-10-11 03:17:05,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:05,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:05,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:05,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:05,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:05,024 INFO L87 Difference]: Start difference. First operand 1734 states and 2291 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:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:05,299 INFO L93 Difference]: Finished difference Result 4412 states and 5861 transitions. [2024-10-11 03:17:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:05,299 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:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:05,311 INFO L225 Difference]: With dead ends: 4412 [2024-10-11 03:17:05,312 INFO L226 Difference]: Without dead ends: 2994 [2024-10-11 03:17:05,315 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:05,315 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 202 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:05,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1132 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:05,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2024-10-11 03:17:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2745. [2024-10-11 03:17:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 2032 states have (on average 1.3228346456692914) internal successors, (2688), 2063 states have internal predecessors, (2688), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2024-10-11 03:17:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 3608 transitions. [2024-10-11 03:17:05,580 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 3608 transitions. Word has length 94 [2024-10-11 03:17:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:05,581 INFO L471 AbstractCegarLoop]: Abstraction has 2745 states and 3608 transitions. [2024-10-11 03:17:05,584 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:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3608 transitions. [2024-10-11 03:17:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:17:05,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:05,586 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:05,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:17:05,586 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:05,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1142837102, now seen corresponding path program 1 times [2024-10-11 03:17:05,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:05,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714498801] [2024-10-11 03:17:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:17:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 03:17:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:17:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 03:17:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 03:17:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 03:17:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,676 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:05,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:05,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714498801] [2024-10-11 03:17:05,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714498801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:05,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:05,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:05,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368870811] [2024-10-11 03:17:05,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:05,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:05,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:05,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:05,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:05,678 INFO L87 Difference]: Start difference. First operand 2745 states and 3608 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:06,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:06,146 INFO L93 Difference]: Finished difference Result 6428 states and 8486 transitions. [2024-10-11 03:17:06,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:06,146 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:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:06,164 INFO L225 Difference]: With dead ends: 6428 [2024-10-11 03:17:06,165 INFO L226 Difference]: Without dead ends: 4115 [2024-10-11 03:17:06,169 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:06,170 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 196 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1146 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:06,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1146 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:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2024-10-11 03:17:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 3942. [2024-10-11 03:17:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 2905 states have (on average 1.3180722891566266) internal successors, (3829), 2949 states have internal predecessors, (3829), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-11 03:17:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 5173 transitions. [2024-10-11 03:17:06,513 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 5173 transitions. Word has length 94 [2024-10-11 03:17:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:06,513 INFO L471 AbstractCegarLoop]: Abstraction has 3942 states and 5173 transitions. [2024-10-11 03:17:06,513 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:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 5173 transitions. [2024-10-11 03:17:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:17:06,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:06,515 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:06,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:17:06,516 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:06,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash -116500221, now seen corresponding path program 1 times [2024-10-11 03:17:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:06,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869071494] [2024-10-11 03:17:06,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,570 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:06,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869071494] [2024-10-11 03:17:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869071494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:06,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:06,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:06,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150648696] [2024-10-11 03:17:06,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:06,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:06,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:06,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:06,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:06,573 INFO L87 Difference]: Start difference. First operand 3942 states and 5173 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:06,914 INFO L93 Difference]: Finished difference Result 7585 states and 9999 transitions. [2024-10-11 03:17:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:06,940 INFO L225 Difference]: With dead ends: 7585 [2024-10-11 03:17:06,943 INFO L226 Difference]: Without dead ends: 3975 [2024-10-11 03:17:06,951 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:06,951 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 6 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:06,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 466 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2024-10-11 03:17:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3948. [2024-10-11 03:17:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 2911 states have (on average 1.3174166952937134) internal successors, (3835), 2955 states have internal predecessors, (3835), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-11 03:17:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5179 transitions. [2024-10-11 03:17:07,297 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5179 transitions. Word has length 95 [2024-10-11 03:17:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:07,298 INFO L471 AbstractCegarLoop]: Abstraction has 3948 states and 5179 transitions. [2024-10-11 03:17:07,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5179 transitions. [2024-10-11 03:17:07,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:17:07,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:07,300 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] [2024-10-11 03:17:07,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:17:07,301 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:07,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1006279155, now seen corresponding path program 1 times [2024-10-11 03:17:07,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:07,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112306111] [2024-10-11 03:17:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:07,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:17:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 03:17:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:17:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 03:17:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 03:17:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 03:17:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,405 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:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112306111] [2024-10-11 03:17:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112306111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:07,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:07,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935022913] [2024-10-11 03:17:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:07,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:07,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:07,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:07,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:07,409 INFO L87 Difference]: Start difference. First operand 3948 states and 5179 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:07,705 INFO L93 Difference]: Finished difference Result 7551 states and 9927 transitions. [2024-10-11 03:17:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:07,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 96 [2024-10-11 03:17:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:07,730 INFO L225 Difference]: With dead ends: 7551 [2024-10-11 03:17:07,731 INFO L226 Difference]: Without dead ends: 3669 [2024-10-11 03:17:07,739 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:07,740 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 78 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:07,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 711 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2024-10-11 03:17:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3606. [2024-10-11 03:17:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 2652 states have (on average 1.3273001508295625) internal successors, (3520), 2686 states have internal predecessors, (3520), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-11 03:17:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 4760 transitions. [2024-10-11 03:17:08,188 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 4760 transitions. Word has length 96 [2024-10-11 03:17:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:08,188 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 4760 transitions. [2024-10-11 03:17:08,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 4760 transitions. [2024-10-11 03:17:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:17:08,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:08,190 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:08,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:17:08,191 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:08,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash 976654501, now seen corresponding path program 1 times [2024-10-11 03:17:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:08,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399516650] [2024-10-11 03:17:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,247 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:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:08,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399516650] [2024-10-11 03:17:08,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399516650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:08,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:08,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:08,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990654843] [2024-10-11 03:17:08,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:08,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:08,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:08,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:08,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:08,249 INFO L87 Difference]: Start difference. First operand 3606 states and 4760 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:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:08,547 INFO L93 Difference]: Finished difference Result 7053 states and 9341 transitions. [2024-10-11 03:17:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:08,548 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:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:08,561 INFO L225 Difference]: With dead ends: 7053 [2024-10-11 03:17:08,562 INFO L226 Difference]: Without dead ends: 3616 [2024-10-11 03:17:08,568 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:08,569 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:08,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2024-10-11 03:17:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 3616. [2024-10-11 03:17:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3616 states, 2662 states have (on average 1.3260706235912847) internal successors, (3530), 2696 states have internal predecessors, (3530), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-11 03:17:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 4770 transitions. [2024-10-11 03:17:08,853 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 4770 transitions. Word has length 97 [2024-10-11 03:17:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:08,854 INFO L471 AbstractCegarLoop]: Abstraction has 3616 states and 4770 transitions. [2024-10-11 03:17:08,854 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:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 4770 transitions. [2024-10-11 03:17:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:17:08,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:08,855 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:08,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:17:08,856 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:08,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:08,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1105968182, now seen corresponding path program 1 times [2024-10-11 03:17:08,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:08,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748943262] [2024-10-11 03:17:08,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:08,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,959 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:08,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:08,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748943262] [2024-10-11 03:17:08,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748943262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:08,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:08,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:08,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523486775] [2024-10-11 03:17:08,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:08,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:08,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:08,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:08,962 INFO L87 Difference]: Start difference. First operand 3616 states and 4770 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:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:09,246 INFO L93 Difference]: Finished difference Result 7044 states and 9312 transitions. [2024-10-11 03:17:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:09,246 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:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:09,260 INFO L225 Difference]: With dead ends: 7044 [2024-10-11 03:17:09,260 INFO L226 Difference]: Without dead ends: 3537 [2024-10-11 03:17:09,265 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:09,266 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 60 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:09,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 716 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2024-10-11 03:17:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 2729. [2024-10-11 03:17:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2009 states have (on average 1.320059731209557) internal successors, (2652), 2028 states have internal predecessors, (2652), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2024-10-11 03:17:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 3590 transitions. [2024-10-11 03:17:09,470 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 3590 transitions. Word has length 97 [2024-10-11 03:17:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:09,471 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 3590 transitions. [2024-10-11 03:17:09,471 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:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 3590 transitions. [2024-10-11 03:17:09,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 03:17:09,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:09,475 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:09,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:17:09,475 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:09,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1294447064, now seen corresponding path program 1 times [2024-10-11 03:17:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:09,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739378294] [2024-10-11 03:17:09,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:09,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 03:17:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 03:17:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 03:17:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 03:17:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 03:17:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 03:17:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,996 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:09,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:09,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739378294] [2024-10-11 03:17:09,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739378294] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:09,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701641104] [2024-10-11 03:17:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:09,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:09,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:09,998 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:10,000 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:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 03:17:10,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:10,466 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:10,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:10,713 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:10,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701641104] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:10,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:10,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 23 [2024-10-11 03:17:10,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077009124] [2024-10-11 03:17:10,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:10,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:17:10,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:10,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:17:10,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:17:10,716 INFO L87 Difference]: Start difference. First operand 2729 states and 3590 transitions. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 20 states have internal predecessors, (203), 9 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 12 states have call predecessors, (39), 9 states have call successors, (39) [2024-10-11 03:17:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:12,390 INFO L93 Difference]: Finished difference Result 9056 states and 11922 transitions. [2024-10-11 03:17:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 03:17:12,390 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 20 states have internal predecessors, (203), 9 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 12 states have call predecessors, (39), 9 states have call successors, (39) Word has length 140 [2024-10-11 03:17:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:12,414 INFO L225 Difference]: With dead ends: 9056 [2024-10-11 03:17:12,414 INFO L226 Difference]: Without dead ends: 6553 [2024-10-11 03:17:12,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 03:17:12,422 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 1448 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 3168 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:12,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 3168 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:17:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6553 states. [2024-10-11 03:17:13,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6553 to 5780. [2024-10-11 03:17:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5780 states, 4230 states have (on average 1.315839243498818) internal successors, (5566), 4271 states have internal predecessors, (5566), 1008 states have call successors, (1008), 541 states have call predecessors, (1008), 541 states have return successors, (1008), 967 states have call predecessors, (1008), 1008 states have call successors, (1008) [2024-10-11 03:17:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5780 states to 5780 states and 7582 transitions. [2024-10-11 03:17:13,102 INFO L78 Accepts]: Start accepts. Automaton has 5780 states and 7582 transitions. Word has length 140 [2024-10-11 03:17:13,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:13,102 INFO L471 AbstractCegarLoop]: Abstraction has 5780 states and 7582 transitions. [2024-10-11 03:17:13,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 20 states have internal predecessors, (203), 9 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 12 states have call predecessors, (39), 9 states have call successors, (39) [2024-10-11 03:17:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5780 states and 7582 transitions. [2024-10-11 03:17:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 03:17:13,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:13,110 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] [2024-10-11 03:17:13,124 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:13,313 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:13,314 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:13,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1933689089, now seen corresponding path program 1 times [2024-10-11 03:17:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156866016] [2024-10-11 03:17:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:13,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 03:17:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 03:17:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:17:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 03:17:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 03:17:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 03:17:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,567 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:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156866016] [2024-10-11 03:17:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156866016] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570053753] [2024-10-11 03:17:13,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:13,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:13,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:13,569 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:13,570 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:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 03:17:13,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 41 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 03:17:13,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-11 03:17:13,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570053753] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:13,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 03:17:13,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 9] total 15 [2024-10-11 03:17:13,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339217172] [2024-10-11 03:17:13,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:13,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:13,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:13,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:13,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:17:13,897 INFO L87 Difference]: Start difference. First operand 5780 states and 7582 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 03:17:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:14,228 INFO L93 Difference]: Finished difference Result 10040 states and 13226 transitions. [2024-10-11 03:17:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:14,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 142 [2024-10-11 03:17:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:14,270 INFO L225 Difference]: With dead ends: 10040 [2024-10-11 03:17:14,271 INFO L226 Difference]: Without dead ends: 4409 [2024-10-11 03:17:14,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:17:14,287 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:14,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 727 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2024-10-11 03:17:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4370. [2024-10-11 03:17:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4370 states, 3214 states have (on average 1.3189172370877411) internal successors, (4239), 3242 states have internal predecessors, (4239), 751 states have call successors, (751), 404 states have call predecessors, (751), 404 states have return successors, (751), 723 states have call predecessors, (751), 751 states have call successors, (751) [2024-10-11 03:17:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4370 states to 4370 states and 5741 transitions. [2024-10-11 03:17:14,596 INFO L78 Accepts]: Start accepts. Automaton has 4370 states and 5741 transitions. Word has length 142 [2024-10-11 03:17:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:14,597 INFO L471 AbstractCegarLoop]: Abstraction has 4370 states and 5741 transitions. [2024-10-11 03:17:14,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 03:17:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4370 states and 5741 transitions. [2024-10-11 03:17:14,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 03:17:14,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:14,604 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:14,617 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:14,807 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:14,808 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:14,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:14,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1495348114, now seen corresponding path program 1 times [2024-10-11 03:17:14,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:14,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109187506] [2024-10-11 03:17:14,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:14,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 03:17:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 03:17:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 03:17:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 03:17:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:17:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 03:17:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:15,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:15,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109187506] [2024-10-11 03:17:15,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109187506] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:15,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866963504] [2024-10-11 03:17:15,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:15,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:15,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:15,068 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:15,069 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:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-11 03:17:15,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 58 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:15,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:16,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866963504] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:16,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:16,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 17] total 32 [2024-10-11 03:17:16,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033299537] [2024-10-11 03:17:16,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:16,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 03:17:16,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:16,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 03:17:16,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2024-10-11 03:17:16,598 INFO L87 Difference]: Start difference. First operand 4370 states and 5741 transitions. Second operand has 32 states, 32 states have (on average 7.09375) internal successors, (227), 31 states have internal predecessors, (227), 11 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (41), 12 states have call predecessors, (41), 11 states have call successors, (41) [2024-10-11 03:17:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:20,297 INFO L93 Difference]: Finished difference Result 10791 states and 14222 transitions. [2024-10-11 03:17:20,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-11 03:17:20,298 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.09375) internal successors, (227), 31 states have internal predecessors, (227), 11 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (41), 12 states have call predecessors, (41), 11 states have call successors, (41) Word has length 143 [2024-10-11 03:17:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:20,328 INFO L225 Difference]: With dead ends: 10791 [2024-10-11 03:17:20,328 INFO L226 Difference]: Without dead ends: 6662 [2024-10-11 03:17:20,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1314, Invalid=5328, Unknown=0, NotChecked=0, Total=6642 [2024-10-11 03:17:20,340 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 3270 mSDsluCounter, 6377 mSDsCounter, 0 mSdLazyCounter, 3271 mSolverCounterSat, 1072 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3270 SdHoareTripleChecker+Valid, 6977 SdHoareTripleChecker+Invalid, 4343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1072 IncrementalHoareTripleChecker+Valid, 3271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:20,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3270 Valid, 6977 Invalid, 4343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1072 Valid, 3271 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 03:17:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2024-10-11 03:17:21,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 5431. [2024-10-11 03:17:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5431 states, 4002 states have (on average 1.3130934532733634) internal successors, (5255), 4036 states have internal predecessors, (5255), 921 states have call successors, (921), 507 states have call predecessors, (921), 507 states have return successors, (921), 887 states have call predecessors, (921), 921 states have call successors, (921) [2024-10-11 03:17:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5431 states to 5431 states and 7097 transitions. [2024-10-11 03:17:21,036 INFO L78 Accepts]: Start accepts. Automaton has 5431 states and 7097 transitions. Word has length 143 [2024-10-11 03:17:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:21,037 INFO L471 AbstractCegarLoop]: Abstraction has 5431 states and 7097 transitions. [2024-10-11 03:17:21,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.09375) internal successors, (227), 31 states have internal predecessors, (227), 11 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (41), 12 states have call predecessors, (41), 11 states have call successors, (41) [2024-10-11 03:17:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5431 states and 7097 transitions. [2024-10-11 03:17:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 03:17:21,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:21,045 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:21,060 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:21,249 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:21,250 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:21,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash -219679473, now seen corresponding path program 1 times [2024-10-11 03:17:21,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:21,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869402439] [2024-10-11 03:17:21,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:21,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 03:17:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 03:17:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 03:17:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:17:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 03:17:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 03:17:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-11 03:17:21,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:21,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869402439] [2024-10-11 03:17:21,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869402439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:21,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:21,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:21,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287405170] [2024-10-11 03:17:21,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:21,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:21,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:21,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:21,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:21,467 INFO L87 Difference]: Start difference. First operand 5431 states and 7097 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:22,635 INFO L93 Difference]: Finished difference Result 15545 states and 20379 transitions. [2024-10-11 03:17:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:22,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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 145 [2024-10-11 03:17:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:22,670 INFO L225 Difference]: With dead ends: 15545 [2024-10-11 03:17:22,671 INFO L226 Difference]: Without dead ends: 10711 [2024-10-11 03:17:22,681 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:22,681 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 218 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:22,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 2458 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10711 states. [2024-10-11 03:17:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10711 to 8057. [2024-10-11 03:17:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8057 states, 5886 states have (on average 1.309208290859667) internal successors, (7706), 5939 states have internal predecessors, (7706), 1416 states have call successors, (1416), 754 states have call predecessors, (1416), 754 states have return successors, (1416), 1363 states have call predecessors, (1416), 1416 states have call successors, (1416) [2024-10-11 03:17:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8057 states to 8057 states and 10538 transitions. [2024-10-11 03:17:23,540 INFO L78 Accepts]: Start accepts. Automaton has 8057 states and 10538 transitions. Word has length 145 [2024-10-11 03:17:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:23,540 INFO L471 AbstractCegarLoop]: Abstraction has 8057 states and 10538 transitions. [2024-10-11 03:17:23,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 8057 states and 10538 transitions. [2024-10-11 03:17:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 03:17:23,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:23,550 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] [2024-10-11 03:17:23,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:17:23,551 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:23,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash -280793397, now seen corresponding path program 1 times [2024-10-11 03:17:23,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126640413] [2024-10-11 03:17:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:23,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 03:17:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:17:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 03:17:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 03:17:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 03:17:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:17:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 03:17:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 03:17:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:24,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126640413] [2024-10-11 03:17:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126640413] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580207131] [2024-10-11 03:17:24,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:24,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:24,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:24,285 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:24,286 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:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 03:17:24,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:24,652 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:24,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:24,931 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:24,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580207131] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:24,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:24,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 26 [2024-10-11 03:17:24,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124681452] [2024-10-11 03:17:24,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:24,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 03:17:24,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:24,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 03:17:24,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:17:24,934 INFO L87 Difference]: Start difference. First operand 8057 states and 10538 transitions. Second operand has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 24 states have internal predecessors, (254), 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:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:28,842 INFO L93 Difference]: Finished difference Result 17261 states and 22582 transitions. [2024-10-11 03:17:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-11 03:17:28,842 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 24 states have internal predecessors, (254), 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 145 [2024-10-11 03:17:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:28,878 INFO L225 Difference]: With dead ends: 17261 [2024-10-11 03:17:28,878 INFO L226 Difference]: Without dead ends: 9569 [2024-10-11 03:17:28,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1171, Invalid=5801, Unknown=0, NotChecked=0, Total=6972 [2024-10-11 03:17:28,895 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 2280 mSDsluCounter, 6231 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 799 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2280 SdHoareTripleChecker+Valid, 6723 SdHoareTripleChecker+Invalid, 3874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 799 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:28,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2280 Valid, 6723 Invalid, 3874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [799 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:17:28,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9569 states. [2024-10-11 03:17:29,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9569 to 5588. [2024-10-11 03:17:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5588 states, 4106 states have (on average 1.303214807598636) internal successors, (5351), 4142 states have internal predecessors, (5351), 965 states have call successors, (965), 516 states have call predecessors, (965), 516 states have return successors, (965), 929 states have call predecessors, (965), 965 states have call successors, (965) [2024-10-11 03:17:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5588 states to 5588 states and 7281 transitions. [2024-10-11 03:17:29,900 INFO L78 Accepts]: Start accepts. Automaton has 5588 states and 7281 transitions. Word has length 145 [2024-10-11 03:17:29,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:29,900 INFO L471 AbstractCegarLoop]: Abstraction has 5588 states and 7281 transitions. [2024-10-11 03:17:29,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 24 states have internal predecessors, (254), 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:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand 5588 states and 7281 transitions. [2024-10-11 03:17:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 03:17:29,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:29,905 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:17:29,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:17:30,105 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:30,106 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:30,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash 895353044, now seen corresponding path program 1 times [2024-10-11 03:17:30,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:30,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065241810] [2024-10-11 03:17:30,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:30,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 03:17:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:17:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 03:17:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 03:17:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 03:17:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 03:17:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:30,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065241810] [2024-10-11 03:17:30,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065241810] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104522819] [2024-10-11 03:17:30,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:30,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:30,355 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:30,356 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:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:30,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 03:17:30,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:30,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:31,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104522819] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:31,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2024-10-11 03:17:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657268854] [2024-10-11 03:17:31,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:31,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:17:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:31,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:17:31,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:17:31,105 INFO L87 Difference]: Start difference. First operand 5588 states and 7281 transitions. Second operand has 23 states, 23 states have (on average 10.0) internal successors, (230), 22 states have internal predecessors, (230), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) [2024-10-11 03:17:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:35,466 INFO L93 Difference]: Finished difference Result 14867 states and 19530 transitions. [2024-10-11 03:17:35,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-10-11 03:17:35,466 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.0) internal successors, (230), 22 states have internal predecessors, (230), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) Word has length 147 [2024-10-11 03:17:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:35,494 INFO L225 Difference]: With dead ends: 14867 [2024-10-11 03:17:35,495 INFO L226 Difference]: Without dead ends: 9535 [2024-10-11 03:17:35,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7723 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2714, Invalid=18456, Unknown=0, NotChecked=0, Total=21170 [2024-10-11 03:17:35,508 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 2754 mSDsluCounter, 4204 mSDsCounter, 0 mSdLazyCounter, 2821 mSolverCounterSat, 962 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2754 SdHoareTripleChecker+Valid, 4618 SdHoareTripleChecker+Invalid, 3783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 962 IncrementalHoareTripleChecker+Valid, 2821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:35,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2754 Valid, 4618 Invalid, 3783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [962 Valid, 2821 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:17:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9535 states. [2024-10-11 03:17:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9535 to 8577. [2024-10-11 03:17:36,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8577 states, 6370 states have (on average 1.3023547880690738) internal successors, (8296), 6423 states have internal predecessors, (8296), 1421 states have call successors, (1421), 785 states have call predecessors, (1421), 785 states have return successors, (1421), 1368 states have call predecessors, (1421), 1421 states have call successors, (1421) [2024-10-11 03:17:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8577 states to 8577 states and 11138 transitions. [2024-10-11 03:17:36,684 INFO L78 Accepts]: Start accepts. Automaton has 8577 states and 11138 transitions. Word has length 147 [2024-10-11 03:17:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:36,685 INFO L471 AbstractCegarLoop]: Abstraction has 8577 states and 11138 transitions. [2024-10-11 03:17:36,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.0) internal successors, (230), 22 states have internal predecessors, (230), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) [2024-10-11 03:17:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 8577 states and 11138 transitions. [2024-10-11 03:17:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 03:17:36,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:36,690 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:17:36,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 03:17:36,890 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:36,891 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:36,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:36,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1170692189, now seen corresponding path program 1 times [2024-10-11 03:17:36,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:36,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304598248] [2024-10-11 03:17:36,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:36,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 03:17:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:17:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 03:17:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 03:17:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 03:17:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 03:17:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:37,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304598248] [2024-10-11 03:17:37,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304598248] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:37,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619451721] [2024-10-11 03:17:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:37,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:37,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:37,457 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:37,458 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:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:37,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 03:17:37,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 03:17:37,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-11 03:17:37,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619451721] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:37,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:37,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-10-11 03:17:37,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203714595] [2024-10-11 03:17:37,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:37,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 03:17:37,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:37,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 03:17:37,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:17:37,771 INFO L87 Difference]: Start difference. First operand 8577 states and 11138 transitions. Second operand has 15 states, 15 states have (on average 11.6) internal successors, (174), 14 states have internal predecessors, (174), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-11 03:17:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:39,963 INFO L93 Difference]: Finished difference Result 17733 states and 23016 transitions. [2024-10-11 03:17:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 03:17:39,964 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.6) internal successors, (174), 14 states have internal predecessors, (174), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) Word has length 147 [2024-10-11 03:17:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:39,994 INFO L225 Difference]: With dead ends: 17733 [2024-10-11 03:17:39,994 INFO L226 Difference]: Without dead ends: 9324 [2024-10-11 03:17:40,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=1311, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 03:17:40,009 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 821 mSDsluCounter, 2817 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 3166 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:40,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 3166 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:17:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9324 states. [2024-10-11 03:17:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9324 to 9150. [2024-10-11 03:17:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9150 states, 6797 states have (on average 1.3013094012064146) internal successors, (8845), 6854 states have internal predecessors, (8845), 1513 states have call successors, (1513), 839 states have call predecessors, (1513), 839 states have return successors, (1513), 1456 states have call predecessors, (1513), 1513 states have call successors, (1513) [2024-10-11 03:17:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9150 states to 9150 states and 11871 transitions. [2024-10-11 03:17:41,359 INFO L78 Accepts]: Start accepts. Automaton has 9150 states and 11871 transitions. Word has length 147 [2024-10-11 03:17:41,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:41,359 INFO L471 AbstractCegarLoop]: Abstraction has 9150 states and 11871 transitions. [2024-10-11 03:17:41,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.6) internal successors, (174), 14 states have internal predecessors, (174), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-11 03:17:41,359 INFO L276 IsEmpty]: Start isEmpty. Operand 9150 states and 11871 transitions. [2024-10-11 03:17:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:17:41,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:41,365 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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:41,380 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:17:41,566 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:17:41,567 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:41,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash 677273251, now seen corresponding path program 1 times [2024-10-11 03:17:41,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:41,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975519951] [2024-10-11 03:17:41,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:41,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 03:17:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 03:17:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 03:17:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 03:17:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 03:17:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 03:17:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 03:17:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 03:17:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 03:17:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 03:17:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 03:17:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 03:17:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-11 03:17:41,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:41,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975519951] [2024-10-11 03:17:41,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975519951] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:41,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477681049] [2024-10-11 03:17:41,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:41,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:41,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:41,742 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:17:41,743 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:17:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 03:17:41,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 8 proven. 94 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 03:17:42,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-11 03:17:42,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477681049] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:42,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:42,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2024-10-11 03:17:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737767491] [2024-10-11 03:17:42,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:42,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:17:42,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:42,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:17:42,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:17:42,170 INFO L87 Difference]: Start difference. First operand 9150 states and 11871 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-11 03:17:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:44,252 INFO L93 Difference]: Finished difference Result 23130 states and 29771 transitions. [2024-10-11 03:17:44,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:17:44,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 156 [2024-10-11 03:17:44,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:44,301 INFO L225 Difference]: With dead ends: 23130 [2024-10-11 03:17:44,301 INFO L226 Difference]: Without dead ends: 14244 [2024-10-11 03:17:44,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 338 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:44,320 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 347 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:44,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1837 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14244 states. [2024-10-11 03:17:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14244 to 12026. [2024-10-11 03:17:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12026 states, 8973 states have (on average 1.288086481667224) internal successors, (11558), 9056 states have internal predecessors, (11558), 1936 states have call successors, (1936), 1116 states have call predecessors, (1936), 1116 states have return successors, (1936), 1853 states have call predecessors, (1936), 1936 states have call successors, (1936) [2024-10-11 03:17:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12026 states to 12026 states and 15430 transitions. [2024-10-11 03:17:46,229 INFO L78 Accepts]: Start accepts. Automaton has 12026 states and 15430 transitions. Word has length 156 [2024-10-11 03:17:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:46,230 INFO L471 AbstractCegarLoop]: Abstraction has 12026 states and 15430 transitions. [2024-10-11 03:17:46,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-11 03:17:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 12026 states and 15430 transitions. [2024-10-11 03:17:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 03:17:46,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:46,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,249 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:17:46,436 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:17:46,437 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:46,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:46,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1509517602, now seen corresponding path program 1 times [2024-10-11 03:17:46,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:46,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626709312] [2024-10-11 03:17:46,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:46,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:17:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 03:17:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 03:17:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 03:17:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 03:17:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 03:17:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 03:17:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-11 03:17:47,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:47,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626709312] [2024-10-11 03:17:47,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626709312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:47,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60611570] [2024-10-11 03:17:47,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:47,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:47,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:47,148 INFO L229 MonitoredProcess]: Starting monitored process 9 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:47,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 03:17:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:47,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 03:17:47,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 57 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 03:17:47,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-11 03:17:47,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60611570] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:47,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:47,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-10-11 03:17:47,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555424082] [2024-10-11 03:17:47,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:47,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 03:17:47,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:47,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 03:17:47,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:17:47,929 INFO L87 Difference]: Start difference. First operand 12026 states and 15430 transitions. Second operand has 22 states, 21 states have (on average 11.619047619047619) internal successors, (244), 20 states have internal predecessors, (244), 10 states have call successors, (40), 6 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 10 states have call successors, (39) [2024-10-11 03:17:52,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:52,292 INFO L93 Difference]: Finished difference Result 28556 states and 36365 transitions. [2024-10-11 03:17:52,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-11 03:17:52,293 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 11.619047619047619) internal successors, (244), 20 states have internal predecessors, (244), 10 states have call successors, (40), 6 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 10 states have call successors, (39) Word has length 156 [2024-10-11 03:17:52,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:52,342 INFO L225 Difference]: With dead ends: 28556 [2024-10-11 03:17:52,343 INFO L226 Difference]: Without dead ends: 16755 [2024-10-11 03:17:52,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=748, Invalid=2792, Unknown=0, NotChecked=0, Total=3540 [2024-10-11 03:17:52,363 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1300 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 3189 SdHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:52,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 3189 Invalid, 2115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:17:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16755 states. [2024-10-11 03:17:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16755 to 11533. [2024-10-11 03:17:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11533 states, 8661 states have (on average 1.2625562868029097) internal successors, (10935), 8737 states have internal predecessors, (10935), 1759 states have call successors, (1759), 1112 states have call predecessors, (1759), 1112 states have return successors, (1759), 1683 states have call predecessors, (1759), 1759 states have call successors, (1759) [2024-10-11 03:17:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11533 states to 11533 states and 14453 transitions. [2024-10-11 03:17:54,542 INFO L78 Accepts]: Start accepts. Automaton has 11533 states and 14453 transitions. Word has length 156 [2024-10-11 03:17:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:54,543 INFO L471 AbstractCegarLoop]: Abstraction has 11533 states and 14453 transitions. [2024-10-11 03:17:54,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 11.619047619047619) internal successors, (244), 20 states have internal predecessors, (244), 10 states have call successors, (40), 6 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 10 states have call successors, (39) [2024-10-11 03:17:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 11533 states and 14453 transitions. [2024-10-11 03:17:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 03:17:54,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:54,547 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, 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] [2024-10-11 03:17:54,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 03:17:54,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-11 03:17:54,752 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:54,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash -284173430, now seen corresponding path program 1 times [2024-10-11 03:17:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:54,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223157347] [2024-10-11 03:17:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 03:17:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 03:17:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 03:17:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 03:17:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 03:17:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 03:17:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 03:17:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:17:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:17:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 03:17:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 03:17:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 03:17:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 03:17:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 03:17:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 03:17:54,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:54,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223157347] [2024-10-11 03:17:54,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223157347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:54,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:54,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629841609] [2024-10-11 03:17:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:54,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:54,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:54,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:54,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:54,902 INFO L87 Difference]: Start difference. First operand 11533 states and 14453 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 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) [2024-10-11 03:17:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:58,221 INFO L93 Difference]: Finished difference Result 24942 states and 31265 transitions. [2024-10-11 03:17:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:58,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 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) Word has length 166 [2024-10-11 03:17:58,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:58,267 INFO L225 Difference]: With dead ends: 24942 [2024-10-11 03:17:58,268 INFO L226 Difference]: Without dead ends: 16222 [2024-10-11 03:17:58,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 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:58,279 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 198 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:58,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 2098 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16222 states. [2024-10-11 03:18:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16222 to 14049. [2024-10-11 03:18:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14049 states, 10499 states have (on average 1.2503095532907895) internal successors, (13127), 10595 states have internal predecessors, (13127), 2151 states have call successors, (2151), 1398 states have call predecessors, (2151), 1398 states have return successors, (2151), 2055 states have call predecessors, (2151), 2151 states have call successors, (2151) [2024-10-11 03:18:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14049 states to 14049 states and 17429 transitions. [2024-10-11 03:18:00,969 INFO L78 Accepts]: Start accepts. Automaton has 14049 states and 17429 transitions. Word has length 166 [2024-10-11 03:18:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:00,969 INFO L471 AbstractCegarLoop]: Abstraction has 14049 states and 17429 transitions. [2024-10-11 03:18:00,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 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) [2024-10-11 03:18:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 14049 states and 17429 transitions. [2024-10-11 03:18:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 03:18:00,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:00,975 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, 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] [2024-10-11 03:18:00,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 03:18:00,975 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:00,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 51227029, now seen corresponding path program 1 times [2024-10-11 03:18:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:00,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426495858] [2024-10-11 03:18:00,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:18:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 03:18:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:18:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 03:18:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 03:18:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 03:18:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 03:18:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 03:18:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 03:18:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:18:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 03:18:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:18:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 03:18:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 03:18:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:18:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:18:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 03:18:01,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:01,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426495858] [2024-10-11 03:18:01,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426495858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:01,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587485199] [2024-10-11 03:18:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:01,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:01,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:01,215 INFO L229 MonitoredProcess]: Starting monitored process 10 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:01,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 03:18:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:01,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 03:18:01,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 80 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 03:18:01,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:18:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 03:18:01,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587485199] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:18:01,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:18:01,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 17 [2024-10-11 03:18:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494616474] [2024-10-11 03:18:01,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:18:01,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 03:18:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:01,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 03:18:01,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:18:01,623 INFO L87 Difference]: Start difference. First operand 14049 states and 17429 transitions. Second operand has 17 states, 17 states have (on average 12.647058823529411) internal successors, (215), 17 states have internal predecessors, (215), 8 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2024-10-11 03:18:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:06,133 INFO L93 Difference]: Finished difference Result 29107 states and 36265 transitions. [2024-10-11 03:18:06,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-11 03:18:06,134 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.647058823529411) internal successors, (215), 17 states have internal predecessors, (215), 8 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) Word has length 167 [2024-10-11 03:18:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:06,192 INFO L225 Difference]: With dead ends: 29107 [2024-10-11 03:18:06,192 INFO L226 Difference]: Without dead ends: 15962 [2024-10-11 03:18:06,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=754, Invalid=3406, Unknown=0, NotChecked=0, Total=4160 [2024-10-11 03:18:06,213 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 2224 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2224 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:06,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2224 Valid, 2718 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:18:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15962 states. [2024-10-11 03:18:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15962 to 13676. [2024-10-11 03:18:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13676 states, 10179 states have (on average 1.25336477060615) internal successors, (12758), 10272 states have internal predecessors, (12758), 2135 states have call successors, (2135), 1361 states have call predecessors, (2135), 1361 states have return successors, (2135), 2042 states have call predecessors, (2135), 2135 states have call successors, (2135) [2024-10-11 03:18:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13676 states to 13676 states and 17028 transitions. [2024-10-11 03:18:09,153 INFO L78 Accepts]: Start accepts. Automaton has 13676 states and 17028 transitions. Word has length 167 [2024-10-11 03:18:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:09,154 INFO L471 AbstractCegarLoop]: Abstraction has 13676 states and 17028 transitions. [2024-10-11 03:18:09,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.647058823529411) internal successors, (215), 17 states have internal predecessors, (215), 8 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2024-10-11 03:18:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 13676 states and 17028 transitions. [2024-10-11 03:18:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 03:18:09,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:09,157 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, 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] [2024-10-11 03:18:09,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 03:18:09,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:09,362 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:09,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1188311031, now seen corresponding path program 1 times [2024-10-11 03:18:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179302786] [2024-10-11 03:18:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:18:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:18:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:18:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:18:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:18:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:18:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:18:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 03:18:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 03:18:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 03:18:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 03:18:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 03:18:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:18:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 03:18:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 03:18:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 03:18:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-11 03:18:09,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:09,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179302786] [2024-10-11 03:18:09,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179302786] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:09,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237402923] [2024-10-11 03:18:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:09,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:09,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:09,881 INFO L229 MonitoredProcess]: Starting monitored process 11 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:09,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 03:18:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:10,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 03:18:10,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 56 proven. 52 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 03:18:10,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:18:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-11 03:18:10,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237402923] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:18:10,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:18:10,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 23 [2024-10-11 03:18:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712084592] [2024-10-11 03:18:10,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:18:10,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:18:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:10,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:18:10,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:18:10,430 INFO L87 Difference]: Start difference. First operand 13676 states and 17028 transitions. Second operand has 23 states, 23 states have (on average 11.130434782608695) internal successors, (256), 20 states have internal predecessors, (256), 9 states have call successors, (48), 4 states have call predecessors, (48), 8 states have return successors, (47), 12 states have call predecessors, (47), 9 states have call successors, (47)