./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.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/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.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', 'fee2fbeec3a60e447cd74345d2f8a46dc28fcea89eab2880c2a2ccd5802bfaa0'] 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/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.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 fee2fbeec3a60e447cd74345d2f8a46dc28fcea89eab2880c2a2ccd5802bfaa0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:42:30,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:42:30,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:42:30,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:42:30,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:42:30,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:42:30,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:42:30,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:42:30,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:42:30,717 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:42:30,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:42:30,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:42:30,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:42:30,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:42:30,718 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:42:30,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:42:30,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:42:30,719 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:42:30,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:42:30,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:42:30,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:42:30,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:42:30,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:42:30,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:42:30,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:42:30,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:42:30,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:42:30,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:42:30,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:42:30,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:42:30,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:42:30,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:42:30,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:42:30,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:42:30,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:42:30,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:42:30,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:42:30,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:42:30,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:42:30,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:42:30,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:42:30,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:42:30,722 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 -> fee2fbeec3a60e447cd74345d2f8a46dc28fcea89eab2880c2a2ccd5802bfaa0 [2024-11-07 01:42:31,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:42:31,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:42:31,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:42:31,010 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:42:31,011 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:42:31,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c [2024-11-07 01:42:32,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:42:32,577 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:42:32,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c [2024-11-07 01:42:32,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d5f2340e/bb4e66096fc04c5cbd6d9940ea9db851/FLAG2f8efd415 [2024-11-07 01:42:32,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d5f2340e/bb4e66096fc04c5cbd6d9940ea9db851 [2024-11-07 01:42:32,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:42:32,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:42:32,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:42:32,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:42:32,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:42:32,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:42:32" (1/1) ... [2024-11-07 01:42:32,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d3ee876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:32, skipping insertion in model container [2024-11-07 01:42:32,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:42:32" (1/1) ... [2024-11-07 01:42:32,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:42:32,810 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/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[913,926] [2024-11-07 01:42:32,861 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/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[5977,5990] [2024-11-07 01:42:32,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:42:32,952 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:42:32,969 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/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[913,926] [2024-11-07 01:42:32,986 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/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[5977,5990] [2024-11-07 01:42:33,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:42:33,050 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:42:33,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33 WrapperNode [2024-11-07 01:42:33,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:42:33,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:42:33,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:42:33,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:42:33,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,108 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 723 [2024-11-07 01:42:33,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:42:33,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:42:33,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:42:33,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:42:33,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,141 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 01:42:33,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:42:33,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:42:33,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:42:33,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:42:33,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (1/1) ... [2024-11-07 01:42:33,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:42:33,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:33,219 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 01:42:33,223 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 01:42:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:42:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:42:33,248 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:42:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-07 01:42:33,248 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-07 01:42:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:42:33,248 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:42:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:42:33,248 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:42:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:42:33,248 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:42:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:42:33,248 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:42:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:42:33,248 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:42:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:42:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:42:33,248 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:42:33,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:42:33,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:42:33,249 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:42:33,249 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:42:33,390 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:42:33,394 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:42:34,253 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-07 01:42:34,253 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:42:34,277 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:42:34,277 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-07 01:42:34,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:42:34 BoogieIcfgContainer [2024-11-07 01:42:34,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:42:34,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:42:34,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:42:34,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:42:34,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:42:32" (1/3) ... [2024-11-07 01:42:34,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c006372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:42:34, skipping insertion in model container [2024-11-07 01:42:34,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:42:33" (2/3) ... [2024-11-07 01:42:34,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c006372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:42:34, skipping insertion in model container [2024-11-07 01:42:34,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:42:34" (3/3) ... [2024-11-07 01:42:34,287 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.06.cil-2.c [2024-11-07 01:42:34,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:42:34,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:42:34,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:42:34,383 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;@b16f9c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:42:34,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:42:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 311 states, 273 states have (on average 1.6007326007326008) internal successors, (437), 278 states have internal predecessors, (437), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 01:42:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 01:42:34,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:34,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:34,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:34,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1020117344, now seen corresponding path program 1 times [2024-11-07 01:42:34,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:34,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726000009] [2024-11-07 01:42:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:34,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 01:42:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:34,753 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 01:42:34,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:34,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726000009] [2024-11-07 01:42:34,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726000009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:34,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:34,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:34,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386176860] [2024-11-07 01:42:34,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:34,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:34,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:34,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:34,790 INFO L87 Difference]: Start difference. First operand has 311 states, 273 states have (on average 1.6007326007326008) internal successors, (437), 278 states have internal predecessors, (437), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:35,330 INFO L93 Difference]: Finished difference Result 673 states and 1058 transitions. [2024-11-07 01:42:35,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-07 01:42:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:35,344 INFO L225 Difference]: With dead ends: 673 [2024-11-07 01:42:35,346 INFO L226 Difference]: Without dead ends: 371 [2024-11-07 01:42:35,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 01:42:35,357 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 590 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:35,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 623 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:42:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-07 01:42:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 365. [2024-11-07 01:42:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 322 states have (on average 1.4782608695652173) internal successors, (476), 326 states have internal predecessors, (476), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2024-11-07 01:42:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 540 transitions. [2024-11-07 01:42:35,455 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 540 transitions. Word has length 44 [2024-11-07 01:42:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:35,456 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 540 transitions. [2024-11-07 01:42:35,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 540 transitions. [2024-11-07 01:42:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 01:42:35,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:35,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:35,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:42:35,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:35,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:35,462 INFO L85 PathProgramCache]: Analyzing trace with hash -300926777, now seen corresponding path program 1 times [2024-11-07 01:42:35,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:35,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985624431] [2024-11-07 01:42:35,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:35,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 01:42:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:35,599 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 01:42:35,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:35,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985624431] [2024-11-07 01:42:35,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985624431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:35,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:35,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:35,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175957648] [2024-11-07 01:42:35,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:35,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:35,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:35,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:35,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:35,602 INFO L87 Difference]: Start difference. First operand 365 states and 540 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:36,118 INFO L93 Difference]: Finished difference Result 613 states and 880 transitions. [2024-11-07 01:42:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:36,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-07 01:42:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:36,122 INFO L225 Difference]: With dead ends: 613 [2024-11-07 01:42:36,123 INFO L226 Difference]: Without dead ends: 489 [2024-11-07 01:42:36,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 01:42:36,124 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 249 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:36,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 835 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:42:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-07 01:42:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 432. [2024-11-07 01:42:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 383 states have (on average 1.4621409921671018) internal successors, (560), 387 states have internal predecessors, (560), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (37), 31 states have call predecessors, (37), 31 states have call successors, (37) [2024-11-07 01:42:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 630 transitions. [2024-11-07 01:42:36,179 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 630 transitions. Word has length 45 [2024-11-07 01:42:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:36,180 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 630 transitions. [2024-11-07 01:42:36,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 630 transitions. [2024-11-07 01:42:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-07 01:42:36,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:36,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:36,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:42:36,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:36,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:36,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1585284238, now seen corresponding path program 1 times [2024-11-07 01:42:36,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:36,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459553859] [2024-11-07 01:42:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:36,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:36,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 01:42:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:36,286 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 01:42:36,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459553859] [2024-11-07 01:42:36,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459553859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:36,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:36,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:36,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336043865] [2024-11-07 01:42:36,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:36,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:36,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:36,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:36,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:36,292 INFO L87 Difference]: Start difference. First operand 432 states and 630 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:36,672 INFO L93 Difference]: Finished difference Result 840 states and 1189 transitions. [2024-11-07 01:42:36,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:36,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-07 01:42:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:36,677 INFO L225 Difference]: With dead ends: 840 [2024-11-07 01:42:36,679 INFO L226 Difference]: Without dead ends: 649 [2024-11-07 01:42:36,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 01:42:36,681 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 600 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:36,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 617 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:42:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-07 01:42:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 597. [2024-11-07 01:42:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 529 states have (on average 1.4177693761814745) internal successors, (750), 536 states have internal predecessors, (750), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2024-11-07 01:42:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 848 transitions. [2024-11-07 01:42:36,768 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 848 transitions. Word has length 45 [2024-11-07 01:42:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:36,768 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 848 transitions. [2024-11-07 01:42:36,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:42:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 848 transitions. [2024-11-07 01:42:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 01:42:36,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:36,771 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:42:36,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:42:36,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:36,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2108015824, now seen corresponding path program 1 times [2024-11-07 01:42:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912544871] [2024-11-07 01:42:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:42:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:36,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 01:42:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 01:42:36,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:36,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912544871] [2024-11-07 01:42:36,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912544871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:36,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:36,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488088814] [2024-11-07 01:42:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:36,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:36,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:36,918 INFO L87 Difference]: Start difference. First operand 597 states and 848 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 01:42:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:37,352 INFO L93 Difference]: Finished difference Result 1181 states and 1633 transitions. [2024-11-07 01:42:37,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:37,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2024-11-07 01:42:37,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:37,360 INFO L225 Difference]: With dead ends: 1181 [2024-11-07 01:42:37,361 INFO L226 Difference]: Without dead ends: 825 [2024-11-07 01:42:37,364 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 01:42:37,365 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 233 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:37,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 885 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:42:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-11-07 01:42:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 787. [2024-11-07 01:42:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 695 states have (on average 1.3669064748201438) internal successors, (950), 704 states have internal predecessors, (950), 58 states have call successors, (58), 29 states have call predecessors, (58), 32 states have return successors, (78), 54 states have call predecessors, (78), 56 states have call successors, (78) [2024-11-07 01:42:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1086 transitions. [2024-11-07 01:42:37,436 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1086 transitions. Word has length 62 [2024-11-07 01:42:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:37,437 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1086 transitions. [2024-11-07 01:42:37,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 01:42:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1086 transitions. [2024-11-07 01:42:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:42:37,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:37,443 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:42:37,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:42:37,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:37,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:37,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1042963189, now seen corresponding path program 1 times [2024-11-07 01:42:37,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:37,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460820663] [2024-11-07 01:42:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:37,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:42:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:42:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 01:42:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460820663] [2024-11-07 01:42:37,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460820663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:37,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:42:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125787111] [2024-11-07 01:42:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:37,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:37,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:42:37,543 INFO L87 Difference]: Start difference. First operand 787 states and 1086 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 01:42:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:37,903 INFO L93 Difference]: Finished difference Result 1440 states and 1939 transitions. [2024-11-07 01:42:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:42:37,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-07 01:42:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:37,910 INFO L225 Difference]: With dead ends: 1440 [2024-11-07 01:42:37,910 INFO L226 Difference]: Without dead ends: 986 [2024-11-07 01:42:37,912 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 01:42:37,912 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 587 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:37,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 616 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:42:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2024-11-07 01:42:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 931. [2024-11-07 01:42:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 823 states have (on average 1.3377885783718104) internal successors, (1101), 834 states have internal predecessors, (1101), 66 states have call successors, (66), 35 states have call predecessors, (66), 40 states have return successors, (92), 62 states have call predecessors, (92), 64 states have call successors, (92) [2024-11-07 01:42:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1259 transitions. [2024-11-07 01:42:37,985 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1259 transitions. Word has length 67 [2024-11-07 01:42:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:37,985 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1259 transitions. [2024-11-07 01:42:37,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 01:42:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1259 transitions. [2024-11-07 01:42:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:42:37,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:37,989 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:37,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:42:37,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:37,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:37,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2053976574, now seen corresponding path program 1 times [2024-11-07 01:42:37,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:37,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122129521] [2024-11-07 01:42:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:37,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:42:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:42:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:42:38,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:38,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122129521] [2024-11-07 01:42:38,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122129521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:38,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455164625] [2024-11-07 01:42:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:38,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:38,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:38,183 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 01:42:38,185 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 01:42:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 01:42:38,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:42:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:42:38,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:42:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 01:42:38,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455164625] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:38,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 01:42:38,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-07 01:42:38,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387044876] [2024-11-07 01:42:38,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:38,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:42:38,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:38,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:42:38,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:42:38,467 INFO L87 Difference]: Start difference. First operand 931 states and 1259 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 01:42:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:38,641 INFO L93 Difference]: Finished difference Result 987 states and 1327 transitions. [2024-11-07 01:42:38,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:42:38,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2024-11-07 01:42:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:38,650 INFO L225 Difference]: With dead ends: 987 [2024-11-07 01:42:38,650 INFO L226 Difference]: Without dead ends: 984 [2024-11-07 01:42:38,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:42:38,652 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 805 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:38,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 540 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:42:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-07 01:42:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 930. [2024-11-07 01:42:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 823 states have (on average 1.3353584447144593) internal successors, (1099), 833 states have internal predecessors, (1099), 65 states have call successors, (65), 35 states have call predecessors, (65), 40 states have return successors, (92), 62 states have call predecessors, (92), 64 states have call successors, (92) [2024-11-07 01:42:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1256 transitions. [2024-11-07 01:42:38,710 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1256 transitions. Word has length 68 [2024-11-07 01:42:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:38,711 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1256 transitions. [2024-11-07 01:42:38,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 01:42:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1256 transitions. [2024-11-07 01:42:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 01:42:38,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:38,717 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:42:38,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 01:42:38,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:38,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:38,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:38,919 INFO L85 PathProgramCache]: Analyzing trace with hash 750276014, now seen corresponding path program 1 times [2024-11-07 01:42:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168439031] [2024-11-07 01:42:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:38,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:38,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:39,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:42:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:39,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:42:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:42:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168439031] [2024-11-07 01:42:39,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168439031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975303512] [2024-11-07 01:42:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:39,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:39,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:39,071 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 01:42:39,073 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 01:42:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:39,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 01:42:39,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:42:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:42:39,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:42:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 01:42:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975303512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:42:39,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:42:39,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-07 01:42:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8700317] [2024-11-07 01:42:39,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:42:39,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 01:42:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 01:42:39,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:42:39,568 INFO L87 Difference]: Start difference. First operand 930 states and 1256 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-07 01:42:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:40,839 INFO L93 Difference]: Finished difference Result 2437 states and 3244 transitions. [2024-11-07 01:42:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 01:42:40,840 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-07 01:42:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:40,849 INFO L225 Difference]: With dead ends: 2437 [2024-11-07 01:42:40,849 INFO L226 Difference]: Without dead ends: 1893 [2024-11-07 01:42:40,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-07 01:42:40,852 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 769 mSDsluCounter, 2487 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 2868 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:40,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 2868 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:42:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2024-11-07 01:42:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1293. [2024-11-07 01:42:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1147 states have (on average 1.3068875326939844) internal successors, (1499), 1165 states have internal predecessors, (1499), 85 states have call successors, (85), 49 states have call predecessors, (85), 59 states have return successors, (126), 79 states have call predecessors, (126), 84 states have call successors, (126) [2024-11-07 01:42:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1710 transitions. [2024-11-07 01:42:40,931 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1710 transitions. Word has length 69 [2024-11-07 01:42:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:40,931 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1710 transitions. [2024-11-07 01:42:40,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-07 01:42:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1710 transitions. [2024-11-07 01:42:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 01:42:40,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:40,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 01:42:40,954 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 01:42:41,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:41,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:41,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:41,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1614104128, now seen corresponding path program 1 times [2024-11-07 01:42:41,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:41,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939567460] [2024-11-07 01:42:41,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:41,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:42:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 01:42:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 01:42:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-07 01:42:41,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:41,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939567460] [2024-11-07 01:42:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939567460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:41,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422142536] [2024-11-07 01:42:41,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:41,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:41,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:41,263 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 01:42:41,274 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 01:42:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 01:42:41,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:42:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 01:42:41,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:42:41,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422142536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:41,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:42:41,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-07 01:42:41,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871836125] [2024-11-07 01:42:41,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:41,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:42:41,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:41,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:42:41,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:41,418 INFO L87 Difference]: Start difference. First operand 1293 states and 1710 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 01:42:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:41,495 INFO L93 Difference]: Finished difference Result 1990 states and 2614 transitions. [2024-11-07 01:42:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:42:41,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-07 01:42:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:41,502 INFO L225 Difference]: With dead ends: 1990 [2024-11-07 01:42:41,502 INFO L226 Difference]: Without dead ends: 1171 [2024-11-07 01:42:41,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:41,505 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 409 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:41,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 554 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:42:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-11-07 01:42:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1156. [2024-11-07 01:42:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1026 states have (on average 1.3070175438596492) internal successors, (1341), 1043 states have internal predecessors, (1341), 77 states have call successors, (77), 43 states have call predecessors, (77), 51 states have return successors, (112), 70 states have call predecessors, (112), 76 states have call successors, (112) [2024-11-07 01:42:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1530 transitions. [2024-11-07 01:42:41,567 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1530 transitions. Word has length 88 [2024-11-07 01:42:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:41,567 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1530 transitions. [2024-11-07 01:42:41,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 01:42:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1530 transitions. [2024-11-07 01:42:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 01:42:41,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:41,570 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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 01:42:41,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 01:42:41,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:41,772 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:41,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash -999731169, now seen corresponding path program 1 times [2024-11-07 01:42:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348875377] [2024-11-07 01:42:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:42:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:42:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 01:42:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 01:42:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 01:42:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 01:42:41,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:41,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348875377] [2024-11-07 01:42:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348875377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:42:41,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838179831] [2024-11-07 01:42:41,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:41,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:42:41,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:42:41,888 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 01:42:41,889 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 01:42:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:42:42,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:42:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 01:42:42,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:42:42,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838179831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:42,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:42:42,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-07 01:42:42,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684524071] [2024-11-07 01:42:42,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:42,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:42:42,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:42:42,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:42,044 INFO L87 Difference]: Start difference. First operand 1156 states and 1530 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 01:42:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:42,094 INFO L93 Difference]: Finished difference Result 1535 states and 1998 transitions. [2024-11-07 01:42:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:42:42,094 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), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2024-11-07 01:42:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:42,096 INFO L225 Difference]: With dead ends: 1535 [2024-11-07 01:42:42,096 INFO L226 Difference]: Without dead ends: 235 [2024-11-07 01:42:42,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:42,100 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 62 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:42,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 918 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:42:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-07 01:42:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-07 01:42:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 209 states have internal predecessors, (317), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 01:42:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 357 transitions. [2024-11-07 01:42:42,113 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 357 transitions. Word has length 103 [2024-11-07 01:42:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:42,113 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 357 transitions. [2024-11-07 01:42:42,113 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), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 01:42:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 357 transitions. [2024-11-07 01:42:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:42:42,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:42,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:42,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 01:42:42,314 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,SelfDestructingSolverStorable8 [2024-11-07 01:42:42,315 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:42,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash -917328685, now seen corresponding path program 1 times [2024-11-07 01:42:42,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:42,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583335886] [2024-11-07 01:42:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:42,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:42:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:42:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:42:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:42:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:42,428 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 01:42:42,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:42,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583335886] [2024-11-07 01:42:42,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583335886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:42,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:42,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:42:42,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345477780] [2024-11-07 01:42:42,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:42,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:42:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:42,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:42:42,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:42:42,430 INFO L87 Difference]: Start difference. First operand 235 states and 357 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:43,305 INFO L93 Difference]: Finished difference Result 536 states and 830 transitions. [2024-11-07 01:42:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:42:43,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 01:42:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:43,308 INFO L225 Difference]: With dead ends: 536 [2024-11-07 01:42:43,308 INFO L226 Difference]: Without dead ends: 311 [2024-11-07 01:42:43,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:42:43,311 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 592 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:43,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 469 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:42:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-07 01:42:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 235. [2024-11-07 01:42:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 208 states have (on average 1.5192307692307692) internal successors, (316), 209 states have internal predecessors, (316), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 01:42:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 356 transitions. [2024-11-07 01:42:43,329 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 356 transitions. Word has length 112 [2024-11-07 01:42:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:43,330 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 356 transitions. [2024-11-07 01:42:43,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 356 transitions. [2024-11-07 01:42:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:42:43,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:43,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:43,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:42:43,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:43,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash 389813713, now seen corresponding path program 1 times [2024-11-07 01:42:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:43,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142308776] [2024-11-07 01:42:43,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:42:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:42:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:42:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:42:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:43,497 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 01:42:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:43,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142308776] [2024-11-07 01:42:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142308776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:43,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:43,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:42:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836230950] [2024-11-07 01:42:43,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:43,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:42:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:43,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:42:43,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:42:43,498 INFO L87 Difference]: Start difference. First operand 235 states and 356 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:44,937 INFO L93 Difference]: Finished difference Result 833 states and 1297 transitions. [2024-11-07 01:42:44,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:42:44,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 01:42:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:44,942 INFO L225 Difference]: With dead ends: 833 [2024-11-07 01:42:44,942 INFO L226 Difference]: Without dead ends: 613 [2024-11-07 01:42:44,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:42:44,945 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 878 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:44,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 798 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:42:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-07 01:42:44,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 462. [2024-11-07 01:42:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 413 states have (on average 1.5326876513317191) internal successors, (633), 415 states have internal predecessors, (633), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-11-07 01:42:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 706 transitions. [2024-11-07 01:42:44,992 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 706 transitions. Word has length 112 [2024-11-07 01:42:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:44,993 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 706 transitions. [2024-11-07 01:42:44,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 706 transitions. [2024-11-07 01:42:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:42:44,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:44,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:44,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:42:44,995 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:44,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:44,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1741198931, now seen corresponding path program 1 times [2024-11-07 01:42:44,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:44,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346858572] [2024-11-07 01:42:44,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:44,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:42:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:42:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:42:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:42:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:45,194 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 01:42:45,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:45,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346858572] [2024-11-07 01:42:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346858572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:45,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:45,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:45,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079903080] [2024-11-07 01:42:45,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:45,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:45,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:45,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:45,196 INFO L87 Difference]: Start difference. First operand 462 states and 706 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:46,912 INFO L93 Difference]: Finished difference Result 1370 states and 2131 transitions. [2024-11-07 01:42:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:42:46,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 01:42:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:46,919 INFO L225 Difference]: With dead ends: 1370 [2024-11-07 01:42:46,919 INFO L226 Difference]: Without dead ends: 923 [2024-11-07 01:42:46,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:42:46,923 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 897 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:46,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1521 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:42:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-07 01:42:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 674. [2024-11-07 01:42:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 603 states have (on average 1.5257048092868988) internal successors, (920), 606 states have internal predecessors, (920), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-11-07 01:42:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1025 transitions. [2024-11-07 01:42:46,991 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1025 transitions. Word has length 112 [2024-11-07 01:42:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:46,991 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 1025 transitions. [2024-11-07 01:42:46,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1025 transitions. [2024-11-07 01:42:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:42:46,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:46,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:46,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:42:46,993 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:46,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:46,994 INFO L85 PathProgramCache]: Analyzing trace with hash 122224017, now seen corresponding path program 1 times [2024-11-07 01:42:46,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:46,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557908124] [2024-11-07 01:42:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:46,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:47,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:47,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:42:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:47,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:42:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:47,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:42:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:47,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:42:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:47,187 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 01:42:47,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:47,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557908124] [2024-11-07 01:42:47,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557908124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:47,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:47,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:47,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561681557] [2024-11-07 01:42:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:47,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:47,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:47,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:47,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:47,191 INFO L87 Difference]: Start difference. First operand 674 states and 1025 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:48,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:48,774 INFO L93 Difference]: Finished difference Result 2160 states and 3352 transitions. [2024-11-07 01:42:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:42:48,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 01:42:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:48,783 INFO L225 Difference]: With dead ends: 2160 [2024-11-07 01:42:48,784 INFO L226 Difference]: Without dead ends: 1501 [2024-11-07 01:42:48,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:42:48,787 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 891 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:48,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1519 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:42:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-07 01:42:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1102. [2024-11-07 01:42:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 987 states have (on average 1.5207700101317123) internal successors, (1501), 992 states have internal predecessors, (1501), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-11-07 01:42:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1674 transitions. [2024-11-07 01:42:48,887 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1674 transitions. Word has length 112 [2024-11-07 01:42:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:48,887 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1674 transitions. [2024-11-07 01:42:48,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1674 transitions. [2024-11-07 01:42:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:42:48,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:48,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:48,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:42:48,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:48,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash 93723727, now seen corresponding path program 1 times [2024-11-07 01:42:48,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:48,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524844020] [2024-11-07 01:42:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:48,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:48,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:42:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:42:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:42:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:42:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:49,077 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 01:42:49,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:49,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524844020] [2024-11-07 01:42:49,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524844020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:49,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:49,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:49,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600510249] [2024-11-07 01:42:49,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:49,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:49,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:49,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:49,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:49,078 INFO L87 Difference]: Start difference. First operand 1102 states and 1674 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:50,932 INFO L93 Difference]: Finished difference Result 3690 states and 5705 transitions. [2024-11-07 01:42:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:42:50,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 01:42:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:50,945 INFO L225 Difference]: With dead ends: 3690 [2024-11-07 01:42:50,945 INFO L226 Difference]: Without dead ends: 2603 [2024-11-07 01:42:50,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:42:50,949 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 890 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:50,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1519 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:42:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2024-11-07 01:42:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1959. [2024-11-07 01:42:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1756 states have (on average 1.5165148063781322) internal successors, (2663), 1765 states have internal predecessors, (2663), 140 states have call successors, (140), 54 states have call predecessors, (140), 62 states have return successors, (175), 147 states have call predecessors, (175), 140 states have call successors, (175) [2024-11-07 01:42:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2978 transitions. [2024-11-07 01:42:51,105 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2978 transitions. Word has length 112 [2024-11-07 01:42:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:51,105 INFO L471 AbstractCegarLoop]: Abstraction has 1959 states and 2978 transitions. [2024-11-07 01:42:51,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2978 transitions. [2024-11-07 01:42:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:42:51,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:51,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:51,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:42:51,107 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:51,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:51,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1846858287, now seen corresponding path program 1 times [2024-11-07 01:42:51,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:51,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739936148] [2024-11-07 01:42:51,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:51,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:42:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:42:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:42:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:42:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:51,265 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 01:42:51,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:51,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739936148] [2024-11-07 01:42:51,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739936148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:51,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:51,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747980320] [2024-11-07 01:42:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:51,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:51,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:51,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:51,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:51,268 INFO L87 Difference]: Start difference. First operand 1959 states and 2978 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:53,191 INFO L93 Difference]: Finished difference Result 6749 states and 10427 transitions. [2024-11-07 01:42:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:42:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 01:42:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:53,216 INFO L225 Difference]: With dead ends: 6749 [2024-11-07 01:42:53,217 INFO L226 Difference]: Without dead ends: 4805 [2024-11-07 01:42:53,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:42:53,223 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 889 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:53,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 1519 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:42:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4805 states. [2024-11-07 01:42:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4805 to 3680. [2024-11-07 01:42:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3301 states have (on average 1.5137837019085125) internal successors, (4997), 3318 states have internal predecessors, (4997), 260 states have call successors, (260), 102 states have call predecessors, (260), 118 states have return successors, (357), 275 states have call predecessors, (357), 260 states have call successors, (357) [2024-11-07 01:42:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 5614 transitions. [2024-11-07 01:42:53,567 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 5614 transitions. Word has length 112 [2024-11-07 01:42:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:53,568 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 5614 transitions. [2024-11-07 01:42:53,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 5614 transitions. [2024-11-07 01:42:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:42:53,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:53,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:53,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:42:53,572 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:53,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash 30204943, now seen corresponding path program 1 times [2024-11-07 01:42:53,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201109236] [2024-11-07 01:42:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:53,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:53,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:53,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:42:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:53,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:42:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:53,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:42:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:42:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:53,733 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 01:42:53,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:53,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201109236] [2024-11-07 01:42:53,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201109236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:53,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:53,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:53,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671076184] [2024-11-07 01:42:53,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:53,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:53,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:53,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:53,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:53,736 INFO L87 Difference]: Start difference. First operand 3680 states and 5614 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:55,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:55,761 INFO L93 Difference]: Finished difference Result 12868 states and 19933 transitions. [2024-11-07 01:42:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:42:55,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 01:42:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:55,796 INFO L225 Difference]: With dead ends: 12868 [2024-11-07 01:42:55,796 INFO L226 Difference]: Without dead ends: 9203 [2024-11-07 01:42:55,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:42:55,808 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 888 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:55,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1519 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:42:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9203 states. [2024-11-07 01:42:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9203 to 7137. [2024-11-07 01:42:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7137 states, 6406 states have (on average 1.5121760849203871) internal successors, (9687), 6439 states have internal predecessors, (9687), 500 states have call successors, (500), 198 states have call predecessors, (500), 230 states have return successors, (775), 531 states have call predecessors, (775), 500 states have call successors, (775) [2024-11-07 01:42:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7137 states to 7137 states and 10962 transitions. [2024-11-07 01:42:56,321 INFO L78 Accepts]: Start accepts. Automaton has 7137 states and 10962 transitions. Word has length 112 [2024-11-07 01:42:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:42:56,321 INFO L471 AbstractCegarLoop]: Abstraction has 7137 states and 10962 transitions. [2024-11-07 01:42:56,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 7137 states and 10962 transitions. [2024-11-07 01:42:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:42:56,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:42:56,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:42:56,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:42:56,328 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:42:56,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:42:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash -740528623, now seen corresponding path program 1 times [2024-11-07 01:42:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:42:56,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030745861] [2024-11-07 01:42:56,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:42:56,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:42:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:42:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:56,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:42:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:56,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:42:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:56,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:42:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:56,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:42:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:42:56,494 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 01:42:56,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:42:56,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030745861] [2024-11-07 01:42:56,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030745861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:42:56,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:42:56,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:42:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718008214] [2024-11-07 01:42:56,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:42:56,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:42:56,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:42:56,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:42:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:42:56,496 INFO L87 Difference]: Start difference. First operand 7137 states and 10962 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:42:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:42:59,529 INFO L93 Difference]: Finished difference Result 28083 states and 43621 transitions. [2024-11-07 01:42:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:42:59,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 01:42:59,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:42:59,623 INFO L225 Difference]: With dead ends: 28083 [2024-11-07 01:42:59,624 INFO L226 Difference]: Without dead ends: 20961 [2024-11-07 01:42:59,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:42:59,653 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 950 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:42:59,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 1509 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:42:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20961 states. [2024-11-07 01:43:00,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20961 to 13986. [2024-11-07 01:43:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13986 states, 12583 states have (on average 1.5138679170309148) internal successors, (19049), 12648 states have internal predecessors, (19049), 948 states have call successors, (948), 390 states have call predecessors, (948), 454 states have return successors, (1741), 1011 states have call predecessors, (1741), 948 states have call successors, (1741) [2024-11-07 01:43:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13986 states to 13986 states and 21738 transitions. [2024-11-07 01:43:01,055 INFO L78 Accepts]: Start accepts. Automaton has 13986 states and 21738 transitions. Word has length 112 [2024-11-07 01:43:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:01,056 INFO L471 AbstractCegarLoop]: Abstraction has 13986 states and 21738 transitions. [2024-11-07 01:43:01,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:43:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 13986 states and 21738 transitions. [2024-11-07 01:43:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:43:01,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:01,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:43:01,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:43:01,071 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:01,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1735222321, now seen corresponding path program 1 times [2024-11-07 01:43:01,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:01,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367372411] [2024-11-07 01:43:01,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:01,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:01,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:43:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:43:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:01,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:43:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:01,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:43:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:01,255 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 01:43:01,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:01,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367372411] [2024-11-07 01:43:01,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367372411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:01,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:43:01,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:43:01,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487451435] [2024-11-07 01:43:01,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:01,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:43:01,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:01,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:43:01,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:43:01,257 INFO L87 Difference]: Start difference. First operand 13986 states and 21738 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:43:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:04,761 INFO L93 Difference]: Finished difference Result 54482 states and 85515 transitions. [2024-11-07 01:43:04,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:43:04,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 01:43:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:04,963 INFO L225 Difference]: With dead ends: 54482 [2024-11-07 01:43:04,963 INFO L226 Difference]: Without dead ends: 40511 [2024-11-07 01:43:05,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:43:05,021 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 1148 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:05,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1026 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:43:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40511 states. [2024-11-07 01:43:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40511 to 27331. [2024-11-07 01:43:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27331 states, 24616 states have (on average 1.5149090022749432) internal successors, (37291), 24745 states have internal predecessors, (37291), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 902 states have return successors, (4127), 1939 states have call predecessors, (4127), 1812 states have call successors, (4127) [2024-11-07 01:43:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27331 states to 27331 states and 43230 transitions. [2024-11-07 01:43:07,682 INFO L78 Accepts]: Start accepts. Automaton has 27331 states and 43230 transitions. Word has length 112 [2024-11-07 01:43:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:07,684 INFO L471 AbstractCegarLoop]: Abstraction has 27331 states and 43230 transitions. [2024-11-07 01:43:07,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:43:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 27331 states and 43230 transitions. [2024-11-07 01:43:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:43:07,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:07,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:43:07,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:43:07,704 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:07,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:07,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1973468753, now seen corresponding path program 1 times [2024-11-07 01:43:07,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:07,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403448664] [2024-11-07 01:43:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:07,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:07,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:43:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:07,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:43:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:43:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:43:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:07,854 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 01:43:07,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:07,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403448664] [2024-11-07 01:43:07,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403448664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:07,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:43:07,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:43:07,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759356180] [2024-11-07 01:43:07,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:07,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:43:07,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:07,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:43:07,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:43:07,856 INFO L87 Difference]: Start difference. First operand 27331 states and 43230 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:43:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:14,244 INFO L93 Difference]: Finished difference Result 105137 states and 167761 transitions. [2024-11-07 01:43:14,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:43:14,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 01:43:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:14,559 INFO L225 Difference]: With dead ends: 105137 [2024-11-07 01:43:14,559 INFO L226 Difference]: Without dead ends: 77821 [2024-11-07 01:43:14,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:43:14,660 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 1065 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:14,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1509 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:43:14,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77821 states. [2024-11-07 01:43:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77821 to 54276. [2024-11-07 01:43:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54276 states, 49001 states have (on average 1.5172955653966245) internal successors, (74349), 49258 states have internal predecessors, (74349), 3476 states have call successors, (3476), 1542 states have call predecessors, (3476), 1798 states have return successors, (10293), 3731 states have call predecessors, (10293), 3476 states have call successors, (10293) [2024-11-07 01:43:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54276 states to 54276 states and 88118 transitions. [2024-11-07 01:43:18,692 INFO L78 Accepts]: Start accepts. Automaton has 54276 states and 88118 transitions. Word has length 112 [2024-11-07 01:43:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:43:18,693 INFO L471 AbstractCegarLoop]: Abstraction has 54276 states and 88118 transitions. [2024-11-07 01:43:18,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:43:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 54276 states and 88118 transitions. [2024-11-07 01:43:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:43:18,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:43:18,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:43:18,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:43:18,730 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:43:18,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:43:18,730 INFO L85 PathProgramCache]: Analyzing trace with hash 14893967, now seen corresponding path program 1 times [2024-11-07 01:43:18,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:43:18,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869726150] [2024-11-07 01:43:18,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:43:18,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:43:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:18,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:43:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:18,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:43:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:43:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:43:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:18,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:43:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:43:18,880 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 01:43:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:43:18,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869726150] [2024-11-07 01:43:18,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869726150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:43:18,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:43:18,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:43:18,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141561800] [2024-11-07 01:43:18,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:43:18,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:43:18,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:43:18,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:43:18,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:43:18,883 INFO L87 Difference]: Start difference. First operand 54276 states and 88118 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:43:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:43:28,792 INFO L93 Difference]: Finished difference Result 201070 states and 330083 transitions. [2024-11-07 01:43:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:43:28,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 01:43:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:43:29,440 INFO L225 Difference]: With dead ends: 201070 [2024-11-07 01:43:29,440 INFO L226 Difference]: Without dead ends: 146809 [2024-11-07 01:43:29,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:43:29,613 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 982 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:43:29,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 1509 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:43:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146809 states.