./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../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 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-4f9af40 [2024-11-07 00:00:47,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:00:47,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:00:47,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:00:47,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:00:47,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:00:47,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:00:47,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:00:47,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:00:47,474 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:00:47,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:00:47,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:00:47,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:00:47,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:00:47,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:00:47,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:00:47,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:00:47,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:00:47,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:00:47,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:00:47,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:00:47,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:00:47,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:00:47,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:00:47,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:00:47,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:00:47,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:00:47,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:00:47,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:00:47,479 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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-11-07 00:00:47,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:00:47,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:00:47,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:00:47,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:00:47,922 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:00:47,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-11-07 00:00:49,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:00:49,778 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:00:49,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-11-07 00:00:49,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/332848d7c/d7b76e14052a40bc90e81ea803f0138d/FLAG08bbf5f88 [2024-11-07 00:00:49,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/332848d7c/d7b76e14052a40bc90e81ea803f0138d [2024-11-07 00:00:49,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:00:49,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:00:49,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:00:49,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:00:49,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:00:49,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:00:49" (1/1) ... [2024-11-07 00:00:49,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6344b0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:49, skipping insertion in model container [2024-11-07 00:00:49,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:00:49" (1/1) ... [2024-11-07 00:00:49,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:00:50,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-11-07 00:00:50,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:00:50,131 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:00:50,188 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-11-07 00:00:50,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:00:50,203 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:00:50,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50 WrapperNode [2024-11-07 00:00:50,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:00:50,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:00:50,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:00:50,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:00:50,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,264 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 507 [2024-11-07 00:00:50,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:00:50,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:00:50,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:00:50,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:00:50,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,323 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-11-07 00:00:50,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:00:50,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:00:50,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:00:50,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:00:50,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (1/1) ... [2024-11-07 00:00:50,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:00:50,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:00:50,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:00:50,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:00:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-07 00:00:50,498 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-07 00:00:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:00:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-07 00:00:50,499 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-07 00:00:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-07 00:00:50,499 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-07 00:00:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-07 00:00:50,499 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-07 00:00:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 00:00:50,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 00:00:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:00:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-07 00:00:50,500 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-07 00:00:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:00:50,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:00:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-07 00:00:50,500 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-07 00:00:50,637 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:00:50,640 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:00:51,179 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-11-07 00:00:51,180 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:00:51,191 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:00:51,191 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:00:51,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:00:51 BoogieIcfgContainer [2024-11-07 00:00:51,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:00:51,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:00:51,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:00:51,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:00:51,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:00:49" (1/3) ... [2024-11-07 00:00:51,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618a5c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:00:51, skipping insertion in model container [2024-11-07 00:00:51,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:50" (2/3) ... [2024-11-07 00:00:51,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618a5c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:00:51, skipping insertion in model container [2024-11-07 00:00:51,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:00:51" (3/3) ... [2024-11-07 00:00:51,201 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-11-07 00:00:51,215 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:00:51,215 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:00:51,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:00:51,296 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;@88ae12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:00:51,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:00:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 142 states have internal predecessors, (218), 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-11-07 00:00:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 00:00:51,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:51,316 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] [2024-11-07 00:00:51,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:51,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:51,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1699901086, now seen corresponding path program 1 times [2024-11-07 00:00:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:51,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352877037] [2024-11-07 00:00:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:51,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:51,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:00:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:51,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:51,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352877037] [2024-11-07 00:00:51,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352877037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:51,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:51,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:00:51,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60738779] [2024-11-07 00:00:51,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:51,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:00:51,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:00:51,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:00:51,580 INFO L87 Difference]: Start difference. First operand has 180 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 142 states have internal predecessors, (218), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-07 00:00:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:51,612 INFO L93 Difference]: Finished difference Result 340 states and 557 transitions. [2024-11-07 00:00:51,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:00:51,614 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 28 [2024-11-07 00:00:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:51,621 INFO L225 Difference]: With dead ends: 340 [2024-11-07 00:00:51,621 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 00:00:51,625 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-11-07 00:00:51,627 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:51,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 00:00:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-07 00:00:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 138 states have internal predecessors, (211), 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-11-07 00:00:51,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 273 transitions. [2024-11-07 00:00:51,725 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 273 transitions. Word has length 28 [2024-11-07 00:00:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:51,726 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 273 transitions. [2024-11-07 00:00:51,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-07 00:00:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 273 transitions. [2024-11-07 00:00:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 00:00:51,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:51,728 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] [2024-11-07 00:00:51,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:00:51,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:51,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1918755804, now seen corresponding path program 1 times [2024-11-07 00:00:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259751509] [2024-11-07 00:00:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:00:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:52,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:52,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259751509] [2024-11-07 00:00:52,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259751509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:52,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:52,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:00:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494145153] [2024-11-07 00:00:52,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:52,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:00:52,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:52,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:00:52,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:00:52,077 INFO L87 Difference]: Start difference. First operand 176 states and 273 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-11-07 00:00:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:52,249 INFO L93 Difference]: Finished difference Result 338 states and 520 transitions. [2024-11-07 00:00:52,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:00:52,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 28 [2024-11-07 00:00:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:52,253 INFO L225 Difference]: With dead ends: 338 [2024-11-07 00:00:52,253 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 00:00:52,259 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-11-07 00:00:52,263 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:52,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1323 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 00:00:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-07 00:00:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.4525547445255473) internal successors, (199), 138 states have internal predecessors, (199), 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-11-07 00:00:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 261 transitions. [2024-11-07 00:00:52,289 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 261 transitions. Word has length 28 [2024-11-07 00:00:52,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:52,289 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 261 transitions. [2024-11-07 00:00:52,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-11-07 00:00:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 261 transitions. [2024-11-07 00:00:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 00:00:52,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:52,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:52,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:00:52,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:52,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1355709569, now seen corresponding path program 1 times [2024-11-07 00:00:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:52,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571625386] [2024-11-07 00:00:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:52,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:52,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571625386] [2024-11-07 00:00:52,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571625386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:52,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:52,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:52,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372514468] [2024-11-07 00:00:52,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:52,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:52,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:52,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:52,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:52,647 INFO L87 Difference]: Start difference. First operand 176 states and 261 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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-11-07 00:00:52,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:52,726 INFO L93 Difference]: Finished difference Result 339 states and 512 transitions. [2024-11-07 00:00:52,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:52,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 39 [2024-11-07 00:00:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:52,729 INFO L225 Difference]: With dead ends: 339 [2024-11-07 00:00:52,732 INFO L226 Difference]: Without dead ends: 180 [2024-11-07 00:00:52,733 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-11-07 00:00:52,734 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:52,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 755 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-07 00:00:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-07 00:00:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 141 states have internal predecessors, (202), 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-11-07 00:00:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 264 transitions. [2024-11-07 00:00:52,758 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 264 transitions. Word has length 39 [2024-11-07 00:00:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:52,759 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 264 transitions. [2024-11-07 00:00:52,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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-11-07 00:00:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2024-11-07 00:00:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:00:52,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:52,762 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] [2024-11-07 00:00:52,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:00:52,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:52,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2086587661, now seen corresponding path program 1 times [2024-11-07 00:00:52,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:52,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148027267] [2024-11-07 00:00:52,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 00:00:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:52,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:52,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148027267] [2024-11-07 00:00:52,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148027267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:52,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:52,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:00:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514363339] [2024-11-07 00:00:52,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:52,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:00:52,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:52,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:00:52,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:00:52,933 INFO L87 Difference]: Start difference. First operand 180 states and 264 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-07 00:00:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:52,996 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2024-11-07 00:00:52,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:00:52,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 55 [2024-11-07 00:00:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:53,000 INFO L225 Difference]: With dead ends: 494 [2024-11-07 00:00:53,002 INFO L226 Difference]: Without dead ends: 331 [2024-11-07 00:00:53,003 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-11-07 00:00:53,004 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 212 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:53,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 523 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-07 00:00:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326. [2024-11-07 00:00:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 249 states have (on average 1.461847389558233) internal successors, (364), 251 states have internal predecessors, (364), 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-11-07 00:00:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2024-11-07 00:00:53,042 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 55 [2024-11-07 00:00:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:53,042 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2024-11-07 00:00:53,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-07 00:00:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2024-11-07 00:00:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:00:53,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:53,044 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] [2024-11-07 00:00:53,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:00:53,045 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:53,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash 651939805, now seen corresponding path program 1 times [2024-11-07 00:00:53,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:53,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144663694] [2024-11-07 00:00:53,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:53,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 00:00:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,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-11-07 00:00:53,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144663694] [2024-11-07 00:00:53,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144663694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:53,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:53,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:00:53,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648546414] [2024-11-07 00:00:53,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:53,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:00:53,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:53,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:00:53,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:00:53,185 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-07 00:00:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:53,260 INFO L93 Difference]: Finished difference Result 917 states and 1373 transitions. [2024-11-07 00:00:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:00:53,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 56 [2024-11-07 00:00:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:53,272 INFO L225 Difference]: With dead ends: 917 [2024-11-07 00:00:53,272 INFO L226 Difference]: Without dead ends: 608 [2024-11-07 00:00:53,274 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-11-07 00:00:53,275 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 214 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:53,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 545 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-07 00:00:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2024-11-07 00:00:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 453 states have (on average 1.4724061810154525) internal successors, (667), 457 states have internal predecessors, (667), 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-11-07 00:00:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 901 transitions. [2024-11-07 00:00:53,346 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 901 transitions. Word has length 56 [2024-11-07 00:00:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:53,346 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 901 transitions. [2024-11-07 00:00:53,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-07 00:00:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 901 transitions. [2024-11-07 00:00:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:00:53,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:53,351 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] [2024-11-07 00:00:53,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:00:53,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:53,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:53,355 INFO L85 PathProgramCache]: Analyzing trace with hash -627923873, now seen corresponding path program 1 times [2024-11-07 00:00:53,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:53,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705916234] [2024-11-07 00:00:53,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:53,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 00:00:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:53,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:53,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705916234] [2024-11-07 00:00:53,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705916234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:53,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:53,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:00:53,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819875017] [2024-11-07 00:00:53,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:53,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:00:53,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:53,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:00:53,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:00:53,585 INFO L87 Difference]: Start difference. First operand 602 states and 901 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-11-07 00:00:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:53,820 INFO L93 Difference]: Finished difference Result 1291 states and 1928 transitions. [2024-11-07 00:00:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:00:53,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 56 [2024-11-07 00:00:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:53,830 INFO L225 Difference]: With dead ends: 1291 [2024-11-07 00:00:53,830 INFO L226 Difference]: Without dead ends: 706 [2024-11-07 00:00:53,834 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-11-07 00:00:53,835 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 368 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:53,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 669 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-07 00:00:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 690. [2024-11-07 00:00:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 528 states have (on average 1.456439393939394) internal successors, (769), 531 states have internal predecessors, (769), 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-11-07 00:00:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1017 transitions. [2024-11-07 00:00:53,921 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1017 transitions. Word has length 56 [2024-11-07 00:00:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:53,921 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1017 transitions. [2024-11-07 00:00:53,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-11-07 00:00:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1017 transitions. [2024-11-07 00:00:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:00:53,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:53,923 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] [2024-11-07 00:00:53,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:00:53,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:53,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:53,924 INFO L85 PathProgramCache]: Analyzing trace with hash 707313810, now seen corresponding path program 1 times [2024-11-07 00:00:53,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:53,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498109801] [2024-11-07 00:00:53,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 00:00:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:54,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:54,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498109801] [2024-11-07 00:00:54,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498109801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:54,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:54,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:00:54,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489369247] [2024-11-07 00:00:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:54,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:00:54,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:54,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:00:54,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:00:54,160 INFO L87 Difference]: Start difference. First operand 690 states and 1017 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 00:00:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:54,388 INFO L93 Difference]: Finished difference Result 1295 states and 1928 transitions. [2024-11-07 00:00:54,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:00:54,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 57 [2024-11-07 00:00:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:54,394 INFO L225 Difference]: With dead ends: 1295 [2024-11-07 00:00:54,394 INFO L226 Difference]: Without dead ends: 710 [2024-11-07 00:00:54,397 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-11-07 00:00:54,397 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 368 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:54,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 669 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-07 00:00:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 698. [2024-11-07 00:00:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4496268656716418) internal successors, (777), 539 states have internal predecessors, (777), 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-11-07 00:00:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1025 transitions. [2024-11-07 00:00:54,447 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1025 transitions. Word has length 57 [2024-11-07 00:00:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:54,448 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1025 transitions. [2024-11-07 00:00:54,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-07 00:00:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1025 transitions. [2024-11-07 00:00:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 00:00:54,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:54,449 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] [2024-11-07 00:00:54,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:00:54,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:54,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1187610108, now seen corresponding path program 1 times [2024-11-07 00:00:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366814618] [2024-11-07 00:00:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:54,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:00:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:54,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:54,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366814618] [2024-11-07 00:00:54,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366814618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:54,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:54,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:54,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405114506] [2024-11-07 00:00:54,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:54,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:54,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:54,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:54,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:54,604 INFO L87 Difference]: Start difference. First operand 698 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-11-07 00:00:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:54,749 INFO L93 Difference]: Finished difference Result 1283 states and 1908 transitions. [2024-11-07 00:00:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:54,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 59 [2024-11-07 00:00:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:54,755 INFO L225 Difference]: With dead ends: 1283 [2024-11-07 00:00:54,755 INFO L226 Difference]: Without dead ends: 698 [2024-11-07 00:00:54,757 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-11-07 00:00:54,757 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 61 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:54,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 663 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-07 00:00:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-07 00:00:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4421641791044777) internal successors, (773), 539 states have internal predecessors, (773), 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-11-07 00:00:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1021 transitions. [2024-11-07 00:00:54,805 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1021 transitions. Word has length 59 [2024-11-07 00:00:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:54,805 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1021 transitions. [2024-11-07 00:00:54,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-11-07 00:00:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1021 transitions. [2024-11-07 00:00:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 00:00:54,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:54,806 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] [2024-11-07 00:00:54,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:00:54,806 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:54,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:54,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1980797779, now seen corresponding path program 1 times [2024-11-07 00:00:54,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:54,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123338523] [2024-11-07 00:00:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:54,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:55,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123338523] [2024-11-07 00:00:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123338523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:55,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131261830] [2024-11-07 00:00:55,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:55,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:55,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:55,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:55,061 INFO L87 Difference]: Start difference. First operand 698 states and 1021 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-11-07 00:00:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:55,135 INFO L93 Difference]: Finished difference Result 1303 states and 1932 transitions. [2024-11-07 00:00:55,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:55,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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 60 [2024-11-07 00:00:55,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:55,141 INFO L225 Difference]: With dead ends: 1303 [2024-11-07 00:00:55,141 INFO L226 Difference]: Without dead ends: 718 [2024-11-07 00:00:55,144 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-11-07 00:00:55,145 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 4 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:55,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 767 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-07 00:00:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2024-11-07 00:00:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 552 states have (on average 1.4293478260869565) internal successors, (789), 555 states have internal predecessors, (789), 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-11-07 00:00:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1037 transitions. [2024-11-07 00:00:55,213 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1037 transitions. Word has length 60 [2024-11-07 00:00:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:55,214 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1037 transitions. [2024-11-07 00:00:55,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-11-07 00:00:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1037 transitions. [2024-11-07 00:00:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 00:00:55,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:55,215 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] [2024-11-07 00:00:55,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:00:55,215 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:55,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1474712019, now seen corresponding path program 1 times [2024-11-07 00:00:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:55,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267153332] [2024-11-07 00:00:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:55,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:55,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267153332] [2024-11-07 00:00:55,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267153332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:55,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:55,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:55,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539780079] [2024-11-07 00:00:55,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:55,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:55,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:55,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:55,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:55,460 INFO L87 Difference]: Start difference. First operand 718 states and 1037 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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-11-07 00:00:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:55,634 INFO L93 Difference]: Finished difference Result 1343 states and 1976 transitions. [2024-11-07 00:00:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:55,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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 68 [2024-11-07 00:00:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:55,642 INFO L225 Difference]: With dead ends: 1343 [2024-11-07 00:00:55,642 INFO L226 Difference]: Without dead ends: 738 [2024-11-07 00:00:55,645 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-11-07 00:00:55,646 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:55,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-07 00:00:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2024-11-07 00:00:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 568 states have (on average 1.4172535211267605) internal successors, (805), 571 states have internal predecessors, (805), 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-11-07 00:00:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1053 transitions. [2024-11-07 00:00:55,724 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1053 transitions. Word has length 68 [2024-11-07 00:00:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:55,724 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1053 transitions. [2024-11-07 00:00:55,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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-11-07 00:00:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1053 transitions. [2024-11-07 00:00:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:00:55,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:55,726 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:55,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:00:55,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:55,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:55,726 INFO L85 PathProgramCache]: Analyzing trace with hash -799213667, now seen corresponding path program 1 times [2024-11-07 00:00:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:55,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193533955] [2024-11-07 00:00:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:55,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:55,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193533955] [2024-11-07 00:00:55,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193533955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:55,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:55,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:55,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297246717] [2024-11-07 00:00:55,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:55,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:55,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:55,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:55,933 INFO L87 Difference]: Start difference. First operand 738 states and 1053 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-11-07 00:00:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:56,007 INFO L93 Difference]: Finished difference Result 1379 states and 1992 transitions. [2024-11-07 00:00:56,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:56,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 76 [2024-11-07 00:00:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:56,015 INFO L225 Difference]: With dead ends: 1379 [2024-11-07 00:00:56,016 INFO L226 Difference]: Without dead ends: 754 [2024-11-07 00:00:56,018 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-11-07 00:00:56,019 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:56,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 763 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-07 00:00:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-11-07 00:00:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 580 states have (on average 1.4086206896551725) internal successors, (817), 583 states have internal predecessors, (817), 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-11-07 00:00:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1065 transitions. [2024-11-07 00:00:56,071 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1065 transitions. Word has length 76 [2024-11-07 00:00:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:56,071 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1065 transitions. [2024-11-07 00:00:56,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-11-07 00:00:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1065 transitions. [2024-11-07 00:00:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:00:56,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:56,075 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:56,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:00:56,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:56,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1597245636, now seen corresponding path program 1 times [2024-11-07 00:00:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:56,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946756302] [2024-11-07 00:00:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:56,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:00:56,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:56,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946756302] [2024-11-07 00:00:56,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946756302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:56,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:56,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:56,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613669023] [2024-11-07 00:00:56,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:56,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:56,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:56,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:56,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:56,297 INFO L87 Difference]: Start difference. First operand 754 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-11-07 00:00:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:56,389 INFO L93 Difference]: Finished difference Result 1415 states and 2032 transitions. [2024-11-07 00:00:56,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:56,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 76 [2024-11-07 00:00:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:56,397 INFO L225 Difference]: With dead ends: 1415 [2024-11-07 00:00:56,397 INFO L226 Difference]: Without dead ends: 774 [2024-11-07 00:00:56,401 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-11-07 00:00:56,402 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:56,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-11-07 00:00:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2024-11-07 00:00:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 596 states have (on average 1.3976510067114094) internal successors, (833), 599 states have internal predecessors, (833), 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-11-07 00:00:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1081 transitions. [2024-11-07 00:00:56,452 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1081 transitions. Word has length 76 [2024-11-07 00:00:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:56,452 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1081 transitions. [2024-11-07 00:00:56,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-11-07 00:00:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1081 transitions. [2024-11-07 00:00:56,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 00:00:56,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:56,454 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:56,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:00:56,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:56,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:56,457 INFO L85 PathProgramCache]: Analyzing trace with hash 837268772, now seen corresponding path program 1 times [2024-11-07 00:00:56,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:56,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604377546] [2024-11-07 00:00:56,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:56,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:00:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:56,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604377546] [2024-11-07 00:00:56,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604377546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:56,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:56,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:56,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78172490] [2024-11-07 00:00:56,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:56,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:56,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:56,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:56,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:56,709 INFO L87 Difference]: Start difference. First operand 774 states and 1081 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, (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-11-07 00:00:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:56,799 INFO L93 Difference]: Finished difference Result 1459 states and 2060 transitions. [2024-11-07 00:00:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:56,800 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, (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 84 [2024-11-07 00:00:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:56,806 INFO L225 Difference]: With dead ends: 1459 [2024-11-07 00:00:56,806 INFO L226 Difference]: Without dead ends: 798 [2024-11-07 00:00:56,809 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-11-07 00:00:56,810 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 5 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:56,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 765 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2024-11-07 00:00:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2024-11-07 00:00:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 616 states have (on average 1.3847402597402598) internal successors, (853), 619 states have internal predecessors, (853), 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-11-07 00:00:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions. [2024-11-07 00:00:56,881 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 84 [2024-11-07 00:00:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:56,881 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions. [2024-11-07 00:00:56,881 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, (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-11-07 00:00:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions. [2024-11-07 00:00:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 00:00:56,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:56,884 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:56,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:00:56,884 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:56,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:56,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1610117125, now seen corresponding path program 1 times [2024-11-07 00:00:56,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:56,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579489287] [2024-11-07 00:00:56,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:56,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:00:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 00:00:57,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:57,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579489287] [2024-11-07 00:00:57,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579489287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:57,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:57,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:57,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874177316] [2024-11-07 00:00:57,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:57,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:57,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:57,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:57,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:57,598 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 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-11-07 00:00:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:57,916 INFO L93 Difference]: Finished difference Result 2053 states and 2823 transitions. [2024-11-07 00:00:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:00:57,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 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 87 [2024-11-07 00:00:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:57,930 INFO L225 Difference]: With dead ends: 2053 [2024-11-07 00:00:57,931 INFO L226 Difference]: Without dead ends: 1368 [2024-11-07 00:00:57,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:00:57,935 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 196 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:57,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1476 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:00:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-07 00:00:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1082. [2024-11-07 00:00:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 827 states have (on average 1.3724304715840387) internal successors, (1135), 832 states have internal predecessors, (1135), 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-11-07 00:00:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1479 transitions. [2024-11-07 00:00:58,054 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1479 transitions. Word has length 87 [2024-11-07 00:00:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:58,055 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1479 transitions. [2024-11-07 00:00:58,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 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-11-07 00:00:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1479 transitions. [2024-11-07 00:00:58,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:00:58,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:58,056 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-11-07 00:00:58,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:00:58,057 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:58,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1820782171, now seen corresponding path program 1 times [2024-11-07 00:00:58,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:58,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130388153] [2024-11-07 00:00:58,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:58,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 00:00:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 00:00:58,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:58,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130388153] [2024-11-07 00:00:58,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130388153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:58,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:58,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:00:58,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101599207] [2024-11-07 00:00:58,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:58,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:00:58,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:58,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:00:58,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:00:58,242 INFO L87 Difference]: Start difference. First operand 1082 states and 1479 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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-11-07 00:00:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:58,336 INFO L93 Difference]: Finished difference Result 2007 states and 2768 transitions. [2024-11-07 00:00:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:00:58,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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 91 [2024-11-07 00:00:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:58,345 INFO L225 Difference]: With dead ends: 2007 [2024-11-07 00:00:58,345 INFO L226 Difference]: Without dead ends: 1106 [2024-11-07 00:00:58,348 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-11-07 00:00:58,349 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:58,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 763 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:00:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2024-11-07 00:00:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2024-11-07 00:00:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 845 states have (on average 1.3644970414201183) internal successors, (1153), 850 states have internal predecessors, (1153), 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-11-07 00:00:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1497 transitions. [2024-11-07 00:00:58,464 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1497 transitions. Word has length 91 [2024-11-07 00:00:58,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:58,465 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1497 transitions. [2024-11-07 00:00:58,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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-11-07 00:00:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1497 transitions. [2024-11-07 00:00:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:00:58,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:58,466 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:58,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:00:58,467 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:58,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:58,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1723609181, now seen corresponding path program 1 times [2024-11-07 00:00:58,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:58,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577475590] [2024-11-07 00:00:58,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:58,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:00:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 00:00:58,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577475590] [2024-11-07 00:00:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577475590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:58,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:58,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:00:58,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763736517] [2024-11-07 00:00:58,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:58,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:00:58,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:58,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:00:58,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:00:58,770 INFO L87 Difference]: Start difference. First operand 1106 states and 1497 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 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-11-07 00:00:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:59,023 INFO L93 Difference]: Finished difference Result 1536 states and 2187 transitions. [2024-11-07 00:00:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:00:59,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 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 90 [2024-11-07 00:00:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:59,034 INFO L225 Difference]: With dead ends: 1536 [2024-11-07 00:00:59,034 INFO L226 Difference]: Without dead ends: 1534 [2024-11-07 00:00:59,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:00:59,035 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 271 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:59,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 2605 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-11-07 00:00:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1114. [2024-11-07 00:00:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 849 states have (on average 1.3627797408716136) internal successors, (1157), 856 states have internal predecessors, (1157), 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-11-07 00:00:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1505 transitions. [2024-11-07 00:00:59,157 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1505 transitions. Word has length 90 [2024-11-07 00:00:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:59,158 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1505 transitions. [2024-11-07 00:00:59,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 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-11-07 00:00:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1505 transitions. [2024-11-07 00:00:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 00:00:59,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:59,160 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:59,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:00:59,160 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:59,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2094931668, now seen corresponding path program 1 times [2024-11-07 00:00:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134197123] [2024-11-07 00:00:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:00:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:00:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:00:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:00:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:00:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:00:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 00:00:59,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:59,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134197123] [2024-11-07 00:00:59,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134197123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:59,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:59,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:59,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620286726] [2024-11-07 00:00:59,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:59,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:59,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:59,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:59,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:59,362 INFO L87 Difference]: Start difference. First operand 1114 states and 1505 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 00:00:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:59,584 INFO L93 Difference]: Finished difference Result 2010 states and 2726 transitions. [2024-11-07 00:00:59,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:00:59,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2024-11-07 00:00:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:59,593 INFO L225 Difference]: With dead ends: 2010 [2024-11-07 00:00:59,593 INFO L226 Difference]: Without dead ends: 1159 [2024-11-07 00:00:59,596 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-11-07 00:00:59,597 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 255 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:59,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1485 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:00:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-07 00:00:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1117. [2024-11-07 00:00:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 863 states have (on average 1.3534183082271147) internal successors, (1168), 875 states have internal predecessors, (1168), 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-11-07 00:00:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1492 transitions. [2024-11-07 00:00:59,686 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1492 transitions. Word has length 93 [2024-11-07 00:00:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:59,687 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1492 transitions. [2024-11-07 00:00:59,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 00:00:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1492 transitions. [2024-11-07 00:00:59,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:00:59,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:59,689 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:59,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:00:59,689 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:59,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1811425973, now seen corresponding path program 1 times [2024-11-07 00:00:59,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:59,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552307524] [2024-11-07 00:00:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:59,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:01:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 00:01:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 00:01:00,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:00,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552307524] [2024-11-07 00:01:00,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552307524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:00,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:00,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:00,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805065000] [2024-11-07 00:01:00,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:00,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:00,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:00,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:00,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:00,248 INFO L87 Difference]: Start difference. First operand 1117 states and 1492 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 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-11-07 00:01:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:00,509 INFO L93 Difference]: Finished difference Result 1989 states and 2669 transitions. [2024-11-07 00:01:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:01:00,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 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 95 [2024-11-07 00:01:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:00,517 INFO L225 Difference]: With dead ends: 1989 [2024-11-07 00:01:00,518 INFO L226 Difference]: Without dead ends: 1115 [2024-11-07 00:01:00,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:01:00,521 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 150 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:00,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1601 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:01:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-11-07 00:01:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1008. [2024-11-07 00:01:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 781 states have (on average 1.3559539052496798) internal successors, (1059), 791 states have internal predecessors, (1059), 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-11-07 00:01:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1349 transitions. [2024-11-07 00:01:00,599 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1349 transitions. Word has length 95 [2024-11-07 00:01:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:00,599 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1349 transitions. [2024-11-07 00:01:00,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 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-11-07 00:01:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1349 transitions. [2024-11-07 00:01:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:01:00,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:00,601 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-11-07 00:01:00,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:01:00,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:00,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash -375753860, now seen corresponding path program 1 times [2024-11-07 00:01:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:00,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999325142] [2024-11-07 00:01:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 00:01:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 00:01:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 00:01:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999325142] [2024-11-07 00:01:01,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999325142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:01,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:01,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742176619] [2024-11-07 00:01:01,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:01,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:01,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:01,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:01,247 INFO L87 Difference]: Start difference. First operand 1008 states and 1349 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 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-11-07 00:01:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:01,672 INFO L93 Difference]: Finished difference Result 1920 states and 2556 transitions. [2024-11-07 00:01:01,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:01,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 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 96 [2024-11-07 00:01:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:01,680 INFO L225 Difference]: With dead ends: 1920 [2024-11-07 00:01:01,681 INFO L226 Difference]: Without dead ends: 1075 [2024-11-07 00:01:01,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:01:01,684 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 409 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:01,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1262 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:01:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2024-11-07 00:01:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1024. [2024-11-07 00:01:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 789 states have (on average 1.3333333333333333) internal successors, (1052), 800 states have internal predecessors, (1052), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-07 00:01:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1348 transitions. [2024-11-07 00:01:01,777 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1348 transitions. Word has length 96 [2024-11-07 00:01:01,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:01,778 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1348 transitions. [2024-11-07 00:01:01,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 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-11-07 00:01:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1348 transitions. [2024-11-07 00:01:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:01:01,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:01,780 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-11-07 00:01:01,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:01:01,780 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:01,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash -566843121, now seen corresponding path program 1 times [2024-11-07 00:01:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:01,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37041408] [2024-11-07 00:01:01,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:01,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 00:01:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:01:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 00:01:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:01:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 00:01:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:01:01,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:01,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37041408] [2024-11-07 00:01:01,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37041408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:01,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:01,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:01,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401043099] [2024-11-07 00:01:01,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:01,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:01,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:01,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:01,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:01,903 INFO L87 Difference]: Start difference. First operand 1024 states and 1348 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-11-07 00:01:02,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:02,146 INFO L93 Difference]: Finished difference Result 2693 states and 3570 transitions. [2024-11-07 00:01:02,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:02,147 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), 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 97 [2024-11-07 00:01:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:02,161 INFO L225 Difference]: With dead ends: 2693 [2024-11-07 00:01:02,161 INFO L226 Difference]: Without dead ends: 1883 [2024-11-07 00:01:02,164 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-11-07 00:01:02,165 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 201 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:02,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1151 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:01:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2024-11-07 00:01:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1768. [2024-11-07 00:01:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1343 states have (on average 1.326880119136262) internal successors, (1782), 1362 states have internal predecessors, (1782), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2024-11-07 00:01:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2326 transitions. [2024-11-07 00:01:02,386 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2326 transitions. Word has length 97 [2024-11-07 00:01:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:02,386 INFO L471 AbstractCegarLoop]: Abstraction has 1768 states and 2326 transitions. [2024-11-07 00:01:02,386 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), 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-11-07 00:01:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2326 transitions. [2024-11-07 00:01:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:01:02,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:02,388 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, 1, 1] [2024-11-07 00:01:02,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:01:02,389 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:02,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1375100484, now seen corresponding path program 1 times [2024-11-07 00:01:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214371994] [2024-11-07 00:01:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:02,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 00:01:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:01:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 00:01:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:01:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 00:01:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 00:01:02,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:02,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214371994] [2024-11-07 00:01:02,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214371994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:02,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:02,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:02,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919236914] [2024-11-07 00:01:02,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:02,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:02,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:02,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:02,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:02,971 INFO L87 Difference]: Start difference. First operand 1768 states and 2326 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:03,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:03,490 INFO L93 Difference]: Finished difference Result 3436 states and 4520 transitions. [2024-11-07 00:01:03,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:03,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2024-11-07 00:01:03,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:03,503 INFO L225 Difference]: With dead ends: 3436 [2024-11-07 00:01:03,504 INFO L226 Difference]: Without dead ends: 1964 [2024-11-07 00:01:03,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:01:03,509 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 419 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:03,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1472 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:01:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-11-07 00:01:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1793. [2024-11-07 00:01:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1355 states have (on average 1.3210332103321034) internal successors, (1790), 1375 states have internal predecessors, (1790), 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-11-07 00:01:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2350 transitions. [2024-11-07 00:01:03,702 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2350 transitions. Word has length 99 [2024-11-07 00:01:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:03,703 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2350 transitions. [2024-11-07 00:01:03,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:01:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2350 transitions. [2024-11-07 00:01:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:01:03,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:03,705 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:03,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:01:03,705 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:03,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:03,706 INFO L85 PathProgramCache]: Analyzing trace with hash -599061911, now seen corresponding path program 1 times [2024-11-07 00:01:03,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:03,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037867891] [2024-11-07 00:01:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:03,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:01:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:01:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:01:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:01:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 00:01:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:01:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:03,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037867891] [2024-11-07 00:01:03,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037867891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:03,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:03,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149751972] [2024-11-07 00:01:03,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:03,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:03,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:03,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:03,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:03,853 INFO L87 Difference]: Start difference. First operand 1793 states and 2350 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-07 00:01:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:04,187 INFO L93 Difference]: Finished difference Result 4547 states and 5996 transitions. [2024-11-07 00:01:04,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:04,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 101 [2024-11-07 00:01:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:04,211 INFO L225 Difference]: With dead ends: 4547 [2024-11-07 00:01:04,211 INFO L226 Difference]: Without dead ends: 3091 [2024-11-07 00:01:04,217 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-11-07 00:01:04,218 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 207 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:04,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1189 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states. [2024-11-07 00:01:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 2814. [2024-11-07 00:01:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2101 states have (on average 1.3122322703474536) internal successors, (2757), 2132 states have internal predecessors, (2757), 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-11-07 00:01:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 3677 transitions. [2024-11-07 00:01:04,515 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 3677 transitions. Word has length 101 [2024-11-07 00:01:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:04,516 INFO L471 AbstractCegarLoop]: Abstraction has 2814 states and 3677 transitions. [2024-11-07 00:01:04,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-07 00:01:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3677 transitions. [2024-11-07 00:01:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:01:04,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:04,519 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, 1, 1, 1, 1] [2024-11-07 00:01:04,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:01:04,519 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:04,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash 647926777, now seen corresponding path program 1 times [2024-11-07 00:01:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:04,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341137441] [2024-11-07 00:01:04,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:04,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:01:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 00:01:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 00:01:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 00:01:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 00:01:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:01:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:01:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:04,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341137441] [2024-11-07 00:01:04,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341137441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:04,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:04,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:04,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371636893] [2024-11-07 00:01:04,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:04,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:04,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:04,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:04,705 INFO L87 Difference]: Start difference. First operand 2814 states and 3677 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-07 00:01:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:05,224 INFO L93 Difference]: Finished difference Result 6570 states and 8628 transitions. [2024-11-07 00:01:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:01:05,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 101 [2024-11-07 00:01:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:05,264 INFO L225 Difference]: With dead ends: 6570 [2024-11-07 00:01:05,264 INFO L226 Difference]: Without dead ends: 4213 [2024-11-07 00:01:05,278 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-11-07 00:01:05,279 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 200 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:05,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1201 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:01:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2024-11-07 00:01:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4030. [2024-11-07 00:01:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 2993 states have (on average 1.3087203474774474) internal successors, (3917), 3037 states have internal predecessors, (3917), 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-11-07 00:01:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 5261 transitions. [2024-11-07 00:01:05,733 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 5261 transitions. Word has length 101 [2024-11-07 00:01:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:05,734 INFO L471 AbstractCegarLoop]: Abstraction has 4030 states and 5261 transitions. [2024-11-07 00:01:05,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-07 00:01:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 5261 transitions. [2024-11-07 00:01:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 00:01:05,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:05,738 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, 1, 1, 1, 1, 1] [2024-11-07 00:01:05,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:01:05,738 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:05,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1760044486, now seen corresponding path program 1 times [2024-11-07 00:01:05,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:05,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175325127] [2024-11-07 00:01:05,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:05,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:05,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:05,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 00:01:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:05,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:05,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 00:01:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:05,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:01:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:05,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 00:01:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:05,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:01:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:05,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:01:05,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:05,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175325127] [2024-11-07 00:01:05,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175325127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:05,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:05,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:01:05,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099840164] [2024-11-07 00:01:05,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:05,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:01:05,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:05,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:01:05,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:01:05,832 INFO L87 Difference]: Start difference. First operand 4030 states and 5261 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-07 00:01:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:06,271 INFO L93 Difference]: Finished difference Result 7739 states and 10153 transitions. [2024-11-07 00:01:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:01:06,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 102 [2024-11-07 00:01:06,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:06,300 INFO L225 Difference]: With dead ends: 7739 [2024-11-07 00:01:06,300 INFO L226 Difference]: Without dead ends: 4063 [2024-11-07 00:01:06,313 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-11-07 00:01:06,313 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 6 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:06,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 487 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2024-11-07 00:01:06,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 4036. [2024-11-07 00:01:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4036 states, 2999 states have (on average 1.3081027009003001) internal successors, (3923), 3043 states have internal predecessors, (3923), 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-11-07 00:01:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 5267 transitions. [2024-11-07 00:01:06,770 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 5267 transitions. Word has length 102 [2024-11-07 00:01:06,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:06,771 INFO L471 AbstractCegarLoop]: Abstraction has 4036 states and 5267 transitions. [2024-11-07 00:01:06,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-07 00:01:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 5267 transitions. [2024-11-07 00:01:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 00:01:06,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:06,776 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, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:06,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:01:06,777 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:06,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1930890164, now seen corresponding path program 1 times [2024-11-07 00:01:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166207020] [2024-11-07 00:01:06,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:01:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 00:01:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 00:01:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 00:01:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 00:01:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:01:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:01:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:06,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166207020] [2024-11-07 00:01:06,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166207020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:06,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:06,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:06,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246625161] [2024-11-07 00:01:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:06,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:06,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:06,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:06,932 INFO L87 Difference]: Start difference. First operand 4036 states and 5267 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-11-07 00:01:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:07,317 INFO L93 Difference]: Finished difference Result 7704 states and 10080 transitions. [2024-11-07 00:01:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:07,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 103 [2024-11-07 00:01:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:07,344 INFO L225 Difference]: With dead ends: 7704 [2024-11-07 00:01:07,345 INFO L226 Difference]: Without dead ends: 3744 [2024-11-07 00:01:07,357 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-11-07 00:01:07,358 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 83 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:07,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 746 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2024-11-07 00:01:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3681. [2024-11-07 00:01:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 2727 states have (on average 1.3182984965163183) internal successors, (3595), 2761 states have internal predecessors, (3595), 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-11-07 00:01:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4835 transitions. [2024-11-07 00:01:07,845 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4835 transitions. Word has length 103 [2024-11-07 00:01:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:07,845 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4835 transitions. [2024-11-07 00:01:07,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-11-07 00:01:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4835 transitions. [2024-11-07 00:01:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 00:01:07,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:07,848 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:07,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:01:07,848 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:07,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:07,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1500264054, now seen corresponding path program 1 times [2024-11-07 00:01:07,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:07,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583141437] [2024-11-07 00:01:07,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:07,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:07,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:07,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 00:01:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:07,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:07,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 00:01:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:07,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:01:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:07,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 00:01:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:07,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:01:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:07,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:01:07,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:07,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583141437] [2024-11-07 00:01:07,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583141437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:07,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:07,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:01:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954658471] [2024-11-07 00:01:07,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:07,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:01:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:01:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:01:07,934 INFO L87 Difference]: Start difference. First operand 3681 states and 4835 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-11-07 00:01:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:08,374 INFO L93 Difference]: Finished difference Result 7191 states and 9479 transitions. [2024-11-07 00:01:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:01:08,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 104 [2024-11-07 00:01:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:08,400 INFO L225 Difference]: With dead ends: 7191 [2024-11-07 00:01:08,400 INFO L226 Difference]: Without dead ends: 3691 [2024-11-07 00:01:08,413 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-11-07 00:01:08,414 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:08,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2024-11-07 00:01:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3691. [2024-11-07 00:01:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 2737 states have (on average 1.3171355498721227) internal successors, (3605), 2771 states have internal predecessors, (3605), 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-11-07 00:01:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 4845 transitions. [2024-11-07 00:01:08,744 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 4845 transitions. Word has length 104 [2024-11-07 00:01:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:08,744 INFO L471 AbstractCegarLoop]: Abstraction has 3691 states and 4845 transitions. [2024-11-07 00:01:08,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-11-07 00:01:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 4845 transitions. [2024-11-07 00:01:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 00:01:08,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:08,747 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:08,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:01:08,747 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:08,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1445902481, now seen corresponding path program 1 times [2024-11-07 00:01:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:08,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527748527] [2024-11-07 00:01:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:08,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:08,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 00:01:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:08,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:08,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 00:01:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:08,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:01:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:08,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 00:01:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:08,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:01:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:08,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 00:01:08,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527748527] [2024-11-07 00:01:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527748527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:08,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:01:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5385908] [2024-11-07 00:01:08,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:08,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:01:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:08,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:01:08,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:01:08,885 INFO L87 Difference]: Start difference. First operand 3691 states and 4845 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-11-07 00:01:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:09,136 INFO L93 Difference]: Finished difference Result 7183 states and 9451 transitions. [2024-11-07 00:01:09,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:01:09,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 104 [2024-11-07 00:01:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:09,164 INFO L225 Difference]: With dead ends: 7183 [2024-11-07 00:01:09,165 INFO L226 Difference]: Without dead ends: 3611 [2024-11-07 00:01:09,177 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-11-07 00:01:09,178 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 64 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:09,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 756 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:01:09,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2024-11-07 00:01:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 2783. [2024-11-07 00:01:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2783 states, 2063 states have (on average 1.3116820164808531) internal successors, (2706), 2082 states have internal predecessors, (2706), 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-11-07 00:01:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 3644 transitions. [2024-11-07 00:01:09,425 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 3644 transitions. Word has length 104 [2024-11-07 00:01:09,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:09,426 INFO L471 AbstractCegarLoop]: Abstraction has 2783 states and 3644 transitions. [2024-11-07 00:01:09,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-11-07 00:01:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3644 transitions. [2024-11-07 00:01:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 00:01:09,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:09,454 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, 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-11-07 00:01:09,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:01:09,455 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:09,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:09,455 INFO L85 PathProgramCache]: Analyzing trace with hash 486642331, now seen corresponding path program 1 times [2024-11-07 00:01:09,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:09,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133245249] [2024-11-07 00:01:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:09,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:01:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 00:01:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:01:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:01:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 00:01:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 00:01:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 00:01:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 00:01:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 00:01:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 00:01:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 00:01:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 00:01:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:01:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:09,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:09,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133245249] [2024-11-07 00:01:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133245249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:09,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661737403] [2024-11-07 00:01:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:09,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:09,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:09,881 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:01:09,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 00:01:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:10,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 00:01:10,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-07 00:01:10,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-07 00:01:10,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661737403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:10,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:10,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 19 [2024-11-07 00:01:10,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159770817] [2024-11-07 00:01:10,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:10,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 00:01:10,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:10,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 00:01:10,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:01:10,709 INFO L87 Difference]: Start difference. First operand 2783 states and 3644 transitions. Second operand has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2024-11-07 00:01:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:13,147 INFO L93 Difference]: Finished difference Result 7237 states and 9459 transitions. [2024-11-07 00:01:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-07 00:01:13,148 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) Word has length 153 [2024-11-07 00:01:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:13,173 INFO L225 Difference]: With dead ends: 7237 [2024-11-07 00:01:13,174 INFO L226 Difference]: Without dead ends: 4647 [2024-11-07 00:01:13,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=555, Invalid=2525, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 00:01:13,183 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 1925 mSDsluCounter, 3448 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 3799 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 736 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:13,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 3799 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [736 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:01:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4647 states. [2024-11-07 00:01:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4647 to 4248. [2024-11-07 00:01:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4248 states, 3125 states have (on average 1.30528) internal successors, (4079), 3153 states have internal predecessors, (4079), 730 states have call successors, (730), 392 states have call predecessors, (730), 392 states have return successors, (730), 702 states have call predecessors, (730), 730 states have call successors, (730) [2024-11-07 00:01:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 4248 states and 5539 transitions. [2024-11-07 00:01:13,606 INFO L78 Accepts]: Start accepts. Automaton has 4248 states and 5539 transitions. Word has length 153 [2024-11-07 00:01:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:13,606 INFO L471 AbstractCegarLoop]: Abstraction has 4248 states and 5539 transitions. [2024-11-07 00:01:13,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2024-11-07 00:01:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4248 states and 5539 transitions. [2024-11-07 00:01:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 00:01:13,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:13,615 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:13,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 00:01:13,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-07 00:01:13,819 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:13,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:13,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1043119000, now seen corresponding path program 1 times [2024-11-07 00:01:13,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:13,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407001557] [2024-11-07 00:01:13,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:13,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 00:01:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:01:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 00:01:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:01:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:01:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 00:01:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 00:01:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 00:01:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 00:01:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 00:01:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:01:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:14,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:14,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407001557] [2024-11-07 00:01:14,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407001557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:14,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128203217] [2024-11-07 00:01:14,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:14,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:14,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:14,594 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:01:14,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 00:01:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:14,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 00:01:14,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:01:15,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 00:01:15,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128203217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:15,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:15,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 23 [2024-11-07 00:01:15,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558907053] [2024-11-07 00:01:15,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:15,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 00:01:15,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:15,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 00:01:15,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:01:15,483 INFO L87 Difference]: Start difference. First operand 4248 states and 5539 transitions. Second operand has 23 states, 23 states have (on average 10.173913043478262) internal successors, (234), 20 states have internal predecessors, (234), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) [2024-11-07 00:01:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:18,122 INFO L93 Difference]: Finished difference Result 12450 states and 16227 transitions. [2024-11-07 00:01:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 00:01:18,123 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.173913043478262) internal successors, (234), 20 states have internal predecessors, (234), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) Word has length 154 [2024-11-07 00:01:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:18,168 INFO L225 Difference]: With dead ends: 12450 [2024-11-07 00:01:18,168 INFO L226 Difference]: Without dead ends: 8448 [2024-11-07 00:01:18,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=1532, Unknown=0, NotChecked=0, Total=1892 [2024-11-07 00:01:18,184 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1609 mSDsluCounter, 4073 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:18,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 4468 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:01:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8448 states. [2024-11-07 00:01:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8448 to 7021. [2024-11-07 00:01:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7021 states, 5178 states have (on average 1.3032058709926613) internal successors, (6748), 5223 states have internal predecessors, (6748), 1187 states have call successors, (1187), 655 states have call predecessors, (1187), 655 states have return successors, (1187), 1142 states have call predecessors, (1187), 1187 states have call successors, (1187) [2024-11-07 00:01:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7021 states to 7021 states and 9122 transitions. [2024-11-07 00:01:18,989 INFO L78 Accepts]: Start accepts. Automaton has 7021 states and 9122 transitions. Word has length 154 [2024-11-07 00:01:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:18,989 INFO L471 AbstractCegarLoop]: Abstraction has 7021 states and 9122 transitions. [2024-11-07 00:01:18,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.173913043478262) internal successors, (234), 20 states have internal predecessors, (234), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) [2024-11-07 00:01:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 7021 states and 9122 transitions. [2024-11-07 00:01:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:01:19,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:19,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:19,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 00:01:19,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-07 00:01:19,206 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1742307377, now seen corresponding path program 1 times [2024-11-07 00:01:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:19,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53972233] [2024-11-07 00:01:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:01:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:01:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:01:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:01:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 00:01:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 00:01:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 00:01:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:01:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 00:01:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 00:01:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 00:01:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-07 00:01:19,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:19,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53972233] [2024-11-07 00:01:19,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53972233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:19,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:19,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:19,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409376496] [2024-11-07 00:01:19,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:19,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:19,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:19,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:19,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:19,512 INFO L87 Difference]: Start difference. First operand 7021 states and 9122 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 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-11-07 00:01:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:21,119 INFO L93 Difference]: Finished difference Result 20675 states and 26918 transitions. [2024-11-07 00:01:21,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:01:21,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 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 156 [2024-11-07 00:01:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:21,204 INFO L225 Difference]: With dead ends: 20675 [2024-11-07 00:01:21,204 INFO L226 Difference]: Without dead ends: 13959 [2024-11-07 00:01:21,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:01:21,235 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 224 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:21,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 2584 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:01:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13959 states. [2024-11-07 00:01:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13959 to 10456. [2024-11-07 00:01:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10456 states, 7645 states have (on average 1.3005886200130805) internal successors, (9943), 7715 states have internal predecessors, (9943), 1830 states have call successors, (1830), 980 states have call predecessors, (1830), 980 states have return successors, (1830), 1760 states have call predecessors, (1830), 1830 states have call successors, (1830) [2024-11-07 00:01:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10456 states to 10456 states and 13603 transitions. [2024-11-07 00:01:22,669 INFO L78 Accepts]: Start accepts. Automaton has 10456 states and 13603 transitions. Word has length 156 [2024-11-07 00:01:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:22,673 INFO L471 AbstractCegarLoop]: Abstraction has 10456 states and 13603 transitions. [2024-11-07 00:01:22,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 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-11-07 00:01:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 10456 states and 13603 transitions. [2024-11-07 00:01:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:01:22,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:22,694 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:22,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 00:01:22,695 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:22,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:22,695 INFO L85 PathProgramCache]: Analyzing trace with hash -712568157, now seen corresponding path program 1 times [2024-11-07 00:01:22,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:22,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221883110] [2024-11-07 00:01:22,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:22,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:01:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:01:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:01:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:01:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:01:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 00:01:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 00:01:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 00:01:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:01:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 00:01:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 00:01:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 00:01:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-07 00:01:23,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221883110] [2024-11-07 00:01:23,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221883110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:23,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924547027] [2024-11-07 00:01:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:23,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:23,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:23,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:01:23,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 00:01:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:23,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 00:01:23,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-07 00:01:23,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:01:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924547027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:23,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:01:23,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-11-07 00:01:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431563191] [2024-11-07 00:01:23,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:23,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:23,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:23,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-07 00:01:23,935 INFO L87 Difference]: Start difference. First operand 10456 states and 13603 transitions. Second operand has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 00:01:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:25,049 INFO L93 Difference]: Finished difference Result 17918 states and 23367 transitions. [2024-11-07 00:01:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:01:25,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 156 [2024-11-07 00:01:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:25,101 INFO L225 Difference]: With dead ends: 17918 [2024-11-07 00:01:25,101 INFO L226 Difference]: Without dead ends: 7531 [2024-11-07 00:01:25,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-07 00:01:25,127 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 3 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:25,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1488 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:01:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7531 states. [2024-11-07 00:01:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7531 to 7531. [2024-11-07 00:01:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7531 states, 5530 states have (on average 1.2965641952983724) internal successors, (7170), 5579 states have internal predecessors, (7170), 1305 states have call successors, (1305), 695 states have call predecessors, (1305), 695 states have return successors, (1305), 1256 states have call predecessors, (1305), 1305 states have call successors, (1305) [2024-11-07 00:01:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7531 states to 7531 states and 9780 transitions. [2024-11-07 00:01:25,952 INFO L78 Accepts]: Start accepts. Automaton has 7531 states and 9780 transitions. Word has length 156 [2024-11-07 00:01:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:25,953 INFO L471 AbstractCegarLoop]: Abstraction has 7531 states and 9780 transitions. [2024-11-07 00:01:25,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-07 00:01:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 7531 states and 9780 transitions. [2024-11-07 00:01:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 00:01:25,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:25,963 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, 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-11-07 00:01:25,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 00:01:26,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:26,167 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:26,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2119288524, now seen corresponding path program 1 times [2024-11-07 00:01:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:26,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575771996] [2024-11-07 00:01:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 00:01:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 00:01:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 00:01:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:01:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 00:01:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:01:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 00:01:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:01:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 00:01:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 00:01:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 00:01:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 00:01:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 00:01:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-07 00:01:27,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:27,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575771996] [2024-11-07 00:01:27,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575771996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:27,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244481154] [2024-11-07 00:01:27,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:27,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:27,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:27,012 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:01:27,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 00:01:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:27,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 00:01:27,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-07 00:01:27,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-07 00:01:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244481154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:27,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:27,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-07 00:01:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102869021] [2024-11-07 00:01:27,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:27,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 00:01:27,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:27,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 00:01:27,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-07 00:01:27,496 INFO L87 Difference]: Start difference. First operand 7531 states and 9780 transitions. Second operand has 14 states, 14 states have (on average 14.642857142857142) internal successors, (205), 12 states have internal predecessors, (205), 6 states have call successors, (38), 4 states have call predecessors, (38), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-07 00:01:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:29,624 INFO L93 Difference]: Finished difference Result 19683 states and 25479 transitions. [2024-11-07 00:01:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 00:01:29,625 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 14.642857142857142) internal successors, (205), 12 states have internal predecessors, (205), 6 states have call successors, (38), 4 states have call predecessors, (38), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) Word has length 157 [2024-11-07 00:01:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:29,754 INFO L225 Difference]: With dead ends: 19683 [2024-11-07 00:01:29,758 INFO L226 Difference]: Without dead ends: 12356 [2024-11-07 00:01:29,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2024-11-07 00:01:29,810 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 1319 mSDsluCounter, 3952 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 4422 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:29,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 4422 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:01:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12356 states. [2024-11-07 00:01:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12356 to 7288. [2024-11-07 00:01:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7288 states, 5336 states have (on average 1.2947901049475263) internal successors, (6909), 5386 states have internal predecessors, (6909), 1274 states have call successors, (1274), 677 states have call predecessors, (1274), 677 states have return successors, (1274), 1224 states have call predecessors, (1274), 1274 states have call successors, (1274) [2024-11-07 00:01:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7288 states to 7288 states and 9457 transitions. [2024-11-07 00:01:30,796 INFO L78 Accepts]: Start accepts. Automaton has 7288 states and 9457 transitions. Word has length 157 [2024-11-07 00:01:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:30,797 INFO L471 AbstractCegarLoop]: Abstraction has 7288 states and 9457 transitions. [2024-11-07 00:01:30,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.642857142857142) internal successors, (205), 12 states have internal predecessors, (205), 6 states have call successors, (38), 4 states have call predecessors, (38), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-07 00:01:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7288 states and 9457 transitions. [2024-11-07 00:01:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:01:30,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:30,812 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 00:01:30,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 00:01:31,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-07 00:01:31,016 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1022003271, now seen corresponding path program 1 times [2024-11-07 00:01:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122653881] [2024-11-07 00:01:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:01:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:01:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:01:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:01:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 00:01:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:01:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 00:01:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 00:01:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 00:01:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:01:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 00:01:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 00:01:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-07 00:01:31,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:31,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122653881] [2024-11-07 00:01:31,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122653881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:31,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917522797] [2024-11-07 00:01:31,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:31,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:31,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:31,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:01:31,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 00:01:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:32,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 00:01:32,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 00:01:32,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-07 00:01:33,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917522797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:33,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:33,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 19 [2024-11-07 00:01:33,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009194761] [2024-11-07 00:01:33,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:33,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 00:01:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:33,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 00:01:33,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:01:33,159 INFO L87 Difference]: Start difference. First operand 7288 states and 9457 transitions. Second operand has 19 states, 19 states have (on average 12.0) internal successors, (228), 18 states have internal predecessors, (228), 7 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (32), 8 states have call predecessors, (32), 7 states have call successors, (32) [2024-11-07 00:01:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:38,077 INFO L93 Difference]: Finished difference Result 19940 states and 26014 transitions. [2024-11-07 00:01:38,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-07 00:01:38,078 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.0) internal successors, (228), 18 states have internal predecessors, (228), 7 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (32), 8 states have call predecessors, (32), 7 states have call successors, (32) Word has length 167 [2024-11-07 00:01:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:38,222 INFO L225 Difference]: With dead ends: 19940 [2024-11-07 00:01:38,222 INFO L226 Difference]: Without dead ends: 12946 [2024-11-07 00:01:38,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=433, Invalid=1823, Unknown=0, NotChecked=0, Total=2256 [2024-11-07 00:01:38,264 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 1104 mSDsluCounter, 3253 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 3666 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:38,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 3666 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 00:01:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12946 states. [2024-11-07 00:01:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12946 to 12702. [2024-11-07 00:01:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12702 states, 9407 states have (on average 1.2976506856596153) internal successors, (12207), 9489 states have internal predecessors, (12207), 2124 states have call successors, (2124), 1170 states have call predecessors, (2124), 1170 states have return successors, (2124), 2042 states have call predecessors, (2124), 2124 states have call successors, (2124) [2024-11-07 00:01:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 16455 transitions. [2024-11-07 00:01:41,199 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 16455 transitions. Word has length 167 [2024-11-07 00:01:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:41,200 INFO L471 AbstractCegarLoop]: Abstraction has 12702 states and 16455 transitions. [2024-11-07 00:01:41,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.0) internal successors, (228), 18 states have internal predecessors, (228), 7 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (32), 8 states have call predecessors, (32), 7 states have call successors, (32) [2024-11-07 00:01:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 16455 transitions. [2024-11-07 00:01:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:01:41,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:41,218 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 00:01:41,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 00:01:41,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-07 00:01:41,419 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:41,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash 967582174, now seen corresponding path program 1 times [2024-11-07 00:01:41,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:41,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149146922] [2024-11-07 00:01:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:01:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:01:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:01:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:01:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:01:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 00:01:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:01:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 00:01:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 00:01:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 00:01:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:01:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 00:01:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 00:01:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-07 00:01:42,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:42,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149146922] [2024-11-07 00:01:42,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149146922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:42,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164651218] [2024-11-07 00:01:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:42,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:42,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:42,235 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:01:42,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 00:01:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:42,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 00:01:42,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 00:01:42,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-07 00:01:42,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164651218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:42,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:42,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 25 [2024-11-07 00:01:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691473849] [2024-11-07 00:01:42,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:42,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 00:01:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:42,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 00:01:42,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:01:42,941 INFO L87 Difference]: Start difference. First operand 12702 states and 16455 transitions. Second operand has 25 states, 24 states have (on average 7.333333333333333) internal successors, (176), 19 states have internal predecessors, (176), 5 states have call successors, (28), 4 states have call predecessors, (28), 9 states have return successors, (31), 9 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-07 00:01:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:49,165 INFO L93 Difference]: Finished difference Result 37538 states and 48562 transitions. [2024-11-07 00:01:49,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 00:01:49,166 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.333333333333333) internal successors, (176), 19 states have internal predecessors, (176), 5 states have call successors, (28), 4 states have call predecessors, (28), 9 states have return successors, (31), 9 states have call predecessors, (31), 5 states have call successors, (31) Word has length 167 [2024-11-07 00:01:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:49,410 INFO L225 Difference]: With dead ends: 37538 [2024-11-07 00:01:49,410 INFO L226 Difference]: Without dead ends: 24828 [2024-11-07 00:01:49,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=283, Invalid=1787, Unknown=0, NotChecked=0, Total=2070 [2024-11-07 00:01:49,479 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 1112 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:49,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 4147 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:01:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24828 states. [2024-11-07 00:01:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24828 to 21002. [2024-11-07 00:01:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21002 states, 15351 states have (on average 1.293922220050811) internal successors, (19863), 15529 states have internal predecessors, (19863), 3660 states have call successors, (3660), 1990 states have call predecessors, (3660), 1990 states have return successors, (3660), 3482 states have call predecessors, (3660), 3660 states have call successors, (3660) [2024-11-07 00:01:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21002 states to 21002 states and 27183 transitions. [2024-11-07 00:01:54,975 INFO L78 Accepts]: Start accepts. Automaton has 21002 states and 27183 transitions. Word has length 167 [2024-11-07 00:01:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:54,976 INFO L471 AbstractCegarLoop]: Abstraction has 21002 states and 27183 transitions. [2024-11-07 00:01:54,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.333333333333333) internal successors, (176), 19 states have internal predecessors, (176), 5 states have call successors, (28), 4 states have call predecessors, (28), 9 states have return successors, (31), 9 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-07 00:01:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 21002 states and 27183 transitions. [2024-11-07 00:01:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 00:01:54,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:54,996 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 00:01:55,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 00:01:55,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-07 00:01:55,197 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:55,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:55,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1884077704, now seen corresponding path program 1 times [2024-11-07 00:01:55,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:55,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276888632] [2024-11-07 00:01:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:01:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:01:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:01:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 00:01:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:01:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:01:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:01:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 00:01:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 00:01:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 00:01:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 00:01:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 00:01:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:01:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 00:01:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 00:01:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 00:01:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 00:01:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-07 00:01:56,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276888632] [2024-11-07 00:01:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276888632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:01:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427515706] [2024-11-07 00:01:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:56,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:01:56,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:01:56,936 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:01:56,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 00:01:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:57,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-07 00:01:57,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:01:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 82 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-07 00:01:58,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:01:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-07 00:01:59,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427515706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:01:59,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:01:59,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2024-11-07 00:01:59,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99390114] [2024-11-07 00:01:59,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:01:59,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 00:01:59,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:59,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 00:01:59,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2024-11-07 00:01:59,453 INFO L87 Difference]: Start difference. First operand 21002 states and 27183 transitions. Second operand has 30 states, 30 states have (on average 9.466666666666667) internal successors, (284), 30 states have internal predecessors, (284), 10 states have call successors, (47), 5 states have call predecessors, (47), 6 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46)