./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-1.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/Problem05_label42+token_ring.07.cil-1.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', 'e70b00a4f3ead30bf9fe88f8130a3c8de29ffa3a9165185f8db2f923a85de85c'] 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/Problem05_label42+token_ring.07.cil-1.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 e70b00a4f3ead30bf9fe88f8130a3c8de29ffa3a9165185f8db2f923a85de85c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:57:28,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:57:28,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:57:28,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:57:28,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:57:28,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:57:28,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:57:28,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:57:28,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:57:28,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:57:28,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:57:28,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:57:28,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:57:28,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:57:28,920 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:57:28,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:57:28,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:57:28,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:57:28,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:57:28,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:57:28,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:57:28,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:57:28,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:57:28,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:57:28,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:57:28,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:57:28,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:57:28,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:57:28,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:57:28,923 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 -> e70b00a4f3ead30bf9fe88f8130a3c8de29ffa3a9165185f8db2f923a85de85c [2024-11-07 00:57:29,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:57:29,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:57:29,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:57:29,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:57:29,157 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:57:29,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-1.c [2024-11-07 00:57:30,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:57:30,883 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:57:30,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-1.c [2024-11-07 00:57:30,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8b6ad9e0/3c88b2e42b59480482e423076c4130b7/FLAG6546c247d [2024-11-07 00:57:31,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8b6ad9e0/3c88b2e42b59480482e423076c4130b7 [2024-11-07 00:57:31,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:57:31,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:57:31,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:57:31,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:57:31,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:57:31,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:31" (1/1) ... [2024-11-07 00:57:31,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c428d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:31, skipping insertion in model container [2024-11-07 00:57:31,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:31" (1/1) ... [2024-11-07 00:57:31,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:57:32,528 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/Problem05_label42+token_ring.07.cil-1.c[378560,378573] [2024-11-07 00:57:32,554 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/Problem05_label42+token_ring.07.cil-1.c[383339,383352] [2024-11-07 00:57:32,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:57:32,756 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:57:33,215 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/Problem05_label42+token_ring.07.cil-1.c[378560,378573] [2024-11-07 00:57:33,219 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/Problem05_label42+token_ring.07.cil-1.c[383339,383352] [2024-11-07 00:57:33,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:57:33,294 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:57:33,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33 WrapperNode [2024-11-07 00:57:33,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:57:33,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:57:33,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:57:33,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:57:33,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:33,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:33,788 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12933 [2024-11-07 00:57:33,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:57:33,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:57:33,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:57:33,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:57:33,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:33,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:33,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:33,982 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 00:57:33,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:33,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:34,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:34,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:34,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:34,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:34,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:57:34,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:57:34,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:57:34,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:57:34,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (1/1) ... [2024-11-07 00:57:34,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:57:34,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:57:34,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:57:34,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:57:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:57:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:57:34,376 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:57:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:57:34,376 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:57:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:57:34,377 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:57:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:57:34,377 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:57:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:57:34,377 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:57:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:57:34,377 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:57:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:57:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:57:34,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:57:34,479 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:57:34,481 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:57:40,668 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2024-11-07 00:57:40,668 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:57:40,726 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:57:40,726 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-07 00:57:40,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:40 BoogieIcfgContainer [2024-11-07 00:57:40,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:57:40,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:57:40,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:57:40,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:57:40,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:57:31" (1/3) ... [2024-11-07 00:57:40,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db0b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:40, skipping insertion in model container [2024-11-07 00:57:40,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:33" (2/3) ... [2024-11-07 00:57:40,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db0b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:40, skipping insertion in model container [2024-11-07 00:57:40,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:40" (3/3) ... [2024-11-07 00:57:40,736 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.07.cil-1.c [2024-11-07 00:57:40,748 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:57:40,748 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:57:40,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:57:40,846 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;@286d8b33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:57:40,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:57:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 2448 states, 2418 states have (on average 1.846980976013234) internal successors, (4466), 2421 states have internal predecessors, (4466), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 00:57:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:57:40,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:40,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:40,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:40,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:40,872 INFO L85 PathProgramCache]: Analyzing trace with hash -185655382, now seen corresponding path program 1 times [2024-11-07 00:57:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:40,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034883768] [2024-11-07 00:57:40,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:40,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:57:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:57:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:57:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:41,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034883768] [2024-11-07 00:57:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034883768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:41,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:41,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:57:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861443601] [2024-11-07 00:57:41,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:41,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:57:41,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:57:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:57:41,313 INFO L87 Difference]: Start difference. First operand has 2448 states, 2418 states have (on average 1.846980976013234) internal successors, (4466), 2421 states have internal predecessors, (4466), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 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 00:57:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:42,432 INFO L93 Difference]: Finished difference Result 4971 states and 9143 transitions. [2024-11-07 00:57:42,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:57:42,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 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 123 [2024-11-07 00:57:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:42,461 INFO L225 Difference]: With dead ends: 4971 [2024-11-07 00:57:42,461 INFO L226 Difference]: Without dead ends: 2468 [2024-11-07 00:57:42,473 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 00:57:42,476 INFO L432 NwaCegarLoop]: 4268 mSDtfsCounter, 665 mSDsluCounter, 12351 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 16619 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:42,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 16619 Invalid, 697 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:57:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2024-11-07 00:57:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2381. [2024-11-07 00:57:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2352 states have (on average 1.8337585034013606) internal successors, (4313), 2354 states have internal predecessors, (4313), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 00:57:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 4355 transitions. [2024-11-07 00:57:42,627 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 4355 transitions. Word has length 123 [2024-11-07 00:57:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:42,628 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 4355 transitions. [2024-11-07 00:57:42,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 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 00:57:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 4355 transitions. [2024-11-07 00:57:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:57:42,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:42,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:42,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:57:42,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:42,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1787509996, now seen corresponding path program 1 times [2024-11-07 00:57:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607737367] [2024-11-07 00:57:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:42,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:57:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:42,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:57:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:42,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:57:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:42,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:42,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607737367] [2024-11-07 00:57:42,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607737367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:42,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:42,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:57:42,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995235602] [2024-11-07 00:57:42,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:42,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:57:42,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:42,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:57:42,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:57:42,966 INFO L87 Difference]: Start difference. First operand 2381 states and 4355 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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 00:57:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:44,654 INFO L93 Difference]: Finished difference Result 3053 states and 5418 transitions. [2024-11-07 00:57:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:57:44,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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 123 [2024-11-07 00:57:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:44,670 INFO L225 Difference]: With dead ends: 3053 [2024-11-07 00:57:44,671 INFO L226 Difference]: Without dead ends: 2808 [2024-11-07 00:57:44,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:57:44,676 INFO L432 NwaCegarLoop]: 4179 mSDtfsCounter, 4951 mSDsluCounter, 12535 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4965 SdHoareTripleChecker+Valid, 16714 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:44,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4965 Valid, 16714 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 00:57:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2024-11-07 00:57:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2635. [2024-11-07 00:57:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2583 states have (on average 1.8087495160665892) internal successors, (4672), 2586 states have internal predecessors, (4672), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-11-07 00:57:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 4749 transitions. [2024-11-07 00:57:44,782 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 4749 transitions. Word has length 123 [2024-11-07 00:57:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:44,783 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 4749 transitions. [2024-11-07 00:57:44,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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 00:57:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 4749 transitions. [2024-11-07 00:57:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:57:44,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:44,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:44,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:57:44,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:44,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1061945968, now seen corresponding path program 1 times [2024-11-07 00:57:44,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:44,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932013851] [2024-11-07 00:57:44,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:44,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:44,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:57:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:57:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:45,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:45,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:57:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:45,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:45,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932013851] [2024-11-07 00:57:45,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932013851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:45,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:45,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:45,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625164529] [2024-11-07 00:57:45,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:45,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:45,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:45,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:45,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:45,051 INFO L87 Difference]: Start difference. First operand 2635 states and 4749 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:47,060 INFO L93 Difference]: Finished difference Result 3657 states and 6363 transitions. [2024-11-07 00:57:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:47,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-07 00:57:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:47,081 INFO L225 Difference]: With dead ends: 3657 [2024-11-07 00:57:47,081 INFO L226 Difference]: Without dead ends: 3158 [2024-11-07 00:57:47,086 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 00:57:47,087 INFO L432 NwaCegarLoop]: 4345 mSDtfsCounter, 4964 mSDsluCounter, 17136 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4978 SdHoareTripleChecker+Valid, 21481 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:47,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4978 Valid, 21481 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 00:57:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2024-11-07 00:57:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 2872. [2024-11-07 00:57:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2872 states, 2797 states have (on average 1.7865570253843404) internal successors, (4997), 2801 states have internal predecessors, (4997), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-11-07 00:57:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 5108 transitions. [2024-11-07 00:57:47,169 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 5108 transitions. Word has length 123 [2024-11-07 00:57:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:47,169 INFO L471 AbstractCegarLoop]: Abstraction has 2872 states and 5108 transitions. [2024-11-07 00:57:47,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 5108 transitions. [2024-11-07 00:57:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:57:47,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:47,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:47,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:57:47,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:47,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:47,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1843727314, now seen corresponding path program 1 times [2024-11-07 00:57:47,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:47,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512956512] [2024-11-07 00:57:47,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:47,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:47,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:47,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:57:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:47,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:57:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:47,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:47,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:57:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:47,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512956512] [2024-11-07 00:57:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512956512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:47,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:47,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604784745] [2024-11-07 00:57:47,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:47,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:47,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:47,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:47,366 INFO L87 Difference]: Start difference. First operand 2872 states and 5108 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:49,055 INFO L93 Difference]: Finished difference Result 4547 states and 7746 transitions. [2024-11-07 00:57:49,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:49,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-07 00:57:49,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:49,076 INFO L225 Difference]: With dead ends: 4547 [2024-11-07 00:57:49,076 INFO L226 Difference]: Without dead ends: 3811 [2024-11-07 00:57:49,080 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 00:57:49,080 INFO L432 NwaCegarLoop]: 4343 mSDtfsCounter, 4962 mSDsluCounter, 17136 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4976 SdHoareTripleChecker+Valid, 21479 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:49,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4976 Valid, 21479 Invalid, 2324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 00:57:49,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2024-11-07 00:57:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 3347. [2024-11-07 00:57:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3347 states, 3226 states have (on average 1.7507749535027899) internal successors, (5648), 3232 states have internal predecessors, (5648), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-11-07 00:57:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 3347 states and 5831 transitions. [2024-11-07 00:57:49,161 INFO L78 Accepts]: Start accepts. Automaton has 3347 states and 5831 transitions. Word has length 123 [2024-11-07 00:57:49,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:49,162 INFO L471 AbstractCegarLoop]: Abstraction has 3347 states and 5831 transitions. [2024-11-07 00:57:49,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 5831 transitions. [2024-11-07 00:57:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:57:49,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:49,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:49,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:57:49,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:49,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash 417845936, now seen corresponding path program 1 times [2024-11-07 00:57:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:49,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632577235] [2024-11-07 00:57:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:57:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:57:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:57:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:49,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:49,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632577235] [2024-11-07 00:57:49,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632577235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:49,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:49,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:49,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528546411] [2024-11-07 00:57:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:49,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:49,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:49,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:49,326 INFO L87 Difference]: Start difference. First operand 3347 states and 5831 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:50,936 INFO L93 Difference]: Finished difference Result 6262 states and 10397 transitions. [2024-11-07 00:57:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:50,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-07 00:57:50,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:50,954 INFO L225 Difference]: With dead ends: 6262 [2024-11-07 00:57:50,954 INFO L226 Difference]: Without dead ends: 5051 [2024-11-07 00:57:50,959 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 00:57:50,962 INFO L432 NwaCegarLoop]: 4343 mSDtfsCounter, 4958 mSDsluCounter, 17136 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4972 SdHoareTripleChecker+Valid, 21479 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:50,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4972 Valid, 21479 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:57:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5051 states. [2024-11-07 00:57:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5051 to 4298. [2024-11-07 00:57:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4298 states, 4085 states have (on average 1.7013463892288863) internal successors, (6950), 4095 states have internal predecessors, (6950), 149 states have call successors, (149), 54 states have call predecessors, (149), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-11-07 00:57:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 4298 states and 7283 transitions. [2024-11-07 00:57:51,093 INFO L78 Accepts]: Start accepts. Automaton has 4298 states and 7283 transitions. Word has length 123 [2024-11-07 00:57:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:51,094 INFO L471 AbstractCegarLoop]: Abstraction has 4298 states and 7283 transitions. [2024-11-07 00:57:51,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 4298 states and 7283 transitions. [2024-11-07 00:57:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:57:51,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:51,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:51,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:57:51,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:51,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:51,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1448862738, now seen corresponding path program 1 times [2024-11-07 00:57:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:51,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482482047] [2024-11-07 00:57:51,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:51,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:51,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:57:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:51,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:57:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:51,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:57:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:51,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:51,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482482047] [2024-11-07 00:57:51,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482482047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:51,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:51,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110640228] [2024-11-07 00:57:51,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:51,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:51,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:51,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:51,260 INFO L87 Difference]: Start difference. First operand 4298 states and 7283 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:52,891 INFO L93 Difference]: Finished difference Result 9691 states and 15715 transitions. [2024-11-07 00:57:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:52,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-07 00:57:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:52,923 INFO L225 Difference]: With dead ends: 9691 [2024-11-07 00:57:52,924 INFO L226 Difference]: Without dead ends: 7529 [2024-11-07 00:57:52,930 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 00:57:52,933 INFO L432 NwaCegarLoop]: 4343 mSDtfsCounter, 4954 mSDsluCounter, 17136 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4968 SdHoareTripleChecker+Valid, 21479 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:52,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4968 Valid, 21479 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2253 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:57:52,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7529 states. [2024-11-07 00:57:53,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7529 to 6205. [2024-11-07 00:57:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6205 states, 5808 states have (on average 1.6460055096418733) internal successors, (9560), 5826 states have internal predecessors, (9560), 277 states have call successors, (277), 102 states have call predecessors, (277), 118 states have return successors, (374), 292 states have call predecessors, (374), 277 states have call successors, (374) [2024-11-07 00:57:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 10211 transitions. [2024-11-07 00:57:53,128 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 10211 transitions. Word has length 123 [2024-11-07 00:57:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:53,128 INFO L471 AbstractCegarLoop]: Abstraction has 6205 states and 10211 transitions. [2024-11-07 00:57:53,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 10211 transitions. [2024-11-07 00:57:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:57:53,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:53,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:53,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:57:53,137 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:53,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:53,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1538962160, now seen corresponding path program 1 times [2024-11-07 00:57:53,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:53,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885412710] [2024-11-07 00:57:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:53,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:53,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:57:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:57:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:53,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:57:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:53,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:53,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885412710] [2024-11-07 00:57:53,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885412710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:53,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:53,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:53,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590567192] [2024-11-07 00:57:53,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:53,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:53,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:53,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:53,293 INFO L87 Difference]: Start difference. First operand 6205 states and 10211 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:55,153 INFO L93 Difference]: Finished difference Result 16548 states and 26409 transitions. [2024-11-07 00:57:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:55,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-07 00:57:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:55,185 INFO L225 Difference]: With dead ends: 16548 [2024-11-07 00:57:55,186 INFO L226 Difference]: Without dead ends: 12479 [2024-11-07 00:57:55,197 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 00:57:55,197 INFO L432 NwaCegarLoop]: 4343 mSDtfsCounter, 4956 mSDsluCounter, 17136 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4970 SdHoareTripleChecker+Valid, 21479 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:55,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4970 Valid, 21479 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:57:55,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12479 states. [2024-11-07 00:57:55,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12479 to 10032. [2024-11-07 00:57:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10032 states, 9267 states have (on average 1.5968490342074027) internal successors, (14798), 9301 states have internal predecessors, (14798), 533 states have call successors, (533), 198 states have call predecessors, (533), 230 states have return successors, (808), 564 states have call predecessors, (808), 533 states have call successors, (808) [2024-11-07 00:57:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10032 states to 10032 states and 16139 transitions. [2024-11-07 00:57:55,547 INFO L78 Accepts]: Start accepts. Automaton has 10032 states and 16139 transitions. Word has length 123 [2024-11-07 00:57:55,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:55,548 INFO L471 AbstractCegarLoop]: Abstraction has 10032 states and 16139 transitions. [2024-11-07 00:57:55,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:55,548 INFO L276 IsEmpty]: Start isEmpty. Operand 10032 states and 16139 transitions. [2024-11-07 00:57:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:57:55,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:55,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:55,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:57:55,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:55,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:55,556 INFO L85 PathProgramCache]: Analyzing trace with hash -858508370, now seen corresponding path program 1 times [2024-11-07 00:57:55,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:55,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483436889] [2024-11-07 00:57:55,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:55,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:55,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:55,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:57:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:55,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:57:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:55,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:55,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:57:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:55,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:55,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483436889] [2024-11-07 00:57:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483436889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:55,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:55,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:55,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433573014] [2024-11-07 00:57:55,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:55,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:55,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:55,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:55,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:55,731 INFO L87 Difference]: Start difference. First operand 10032 states and 16139 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:56,930 INFO L93 Difference]: Finished difference Result 20470 states and 32732 transitions. [2024-11-07 00:57:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:57:56,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-07 00:57:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:56,970 INFO L225 Difference]: With dead ends: 20470 [2024-11-07 00:57:56,970 INFO L226 Difference]: Without dead ends: 12574 [2024-11-07 00:57:56,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:57:56,991 INFO L432 NwaCegarLoop]: 4164 mSDtfsCounter, 4697 mSDsluCounter, 16475 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4712 SdHoareTripleChecker+Valid, 20639 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:56,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4712 Valid, 20639 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:57:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12574 states. [2024-11-07 00:57:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12574 to 10032. [2024-11-07 00:57:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10032 states, 9267 states have (on average 1.593288011222618) internal successors, (14765), 9301 states have internal predecessors, (14765), 533 states have call successors, (533), 198 states have call predecessors, (533), 230 states have return successors, (808), 564 states have call predecessors, (808), 533 states have call successors, (808) [2024-11-07 00:57:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10032 states to 10032 states and 16106 transitions. [2024-11-07 00:57:57,443 INFO L78 Accepts]: Start accepts. Automaton has 10032 states and 16106 transitions. Word has length 123 [2024-11-07 00:57:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:57,444 INFO L471 AbstractCegarLoop]: Abstraction has 10032 states and 16106 transitions. [2024-11-07 00:57:57,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 10032 states and 16106 transitions. [2024-11-07 00:57:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:57:57,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:57,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:57,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:57:57,452 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:57,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1530055660, now seen corresponding path program 1 times [2024-11-07 00:57:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:57,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044694196] [2024-11-07 00:57:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:57,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:57:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:57:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:57:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:57,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:57,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044694196] [2024-11-07 00:57:57,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044694196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:57,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764749750] [2024-11-07 00:57:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:57,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:57,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:57,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:57,649 INFO L87 Difference]: Start difference. First operand 10032 states and 16106 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:57:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:59,978 INFO L93 Difference]: Finished difference Result 33620 states and 52881 transitions. [2024-11-07 00:57:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:57:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-07 00:57:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:00,046 INFO L225 Difference]: With dead ends: 33620 [2024-11-07 00:58:00,047 INFO L226 Difference]: Without dead ends: 25724 [2024-11-07 00:58:00,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:58:00,070 INFO L432 NwaCegarLoop]: 4341 mSDtfsCounter, 5236 mSDsluCounter, 17128 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5258 SdHoareTripleChecker+Valid, 21469 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:00,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5258 Valid, 21469 Invalid, 2235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:58:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25724 states. [2024-11-07 00:58:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25724 to 17685. [2024-11-07 00:58:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17685 states, 16216 states have (on average 1.5593857918105574) internal successors, (25287), 16282 states have internal predecessors, (25287), 1013 states have call successors, (1013), 390 states have call predecessors, (1013), 454 states have return successors, (1806), 1076 states have call predecessors, (1806), 1013 states have call successors, (1806) [2024-11-07 00:58:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17685 states to 17685 states and 28106 transitions. [2024-11-07 00:58:00,820 INFO L78 Accepts]: Start accepts. Automaton has 17685 states and 28106 transitions. Word has length 123 [2024-11-07 00:58:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:00,820 INFO L471 AbstractCegarLoop]: Abstraction has 17685 states and 28106 transitions. [2024-11-07 00:58:00,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:58:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 17685 states and 28106 transitions. [2024-11-07 00:58:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:58:00,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:00,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:00,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:58:00,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:00,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1163840530, now seen corresponding path program 1 times [2024-11-07 00:58:00,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:00,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429952088] [2024-11-07 00:58:00,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:00,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:00,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:00,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:58:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:00,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:58:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:00,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:58:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:00,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:58:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:00,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:00,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429952088] [2024-11-07 00:58:00,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429952088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:00,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:00,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:00,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574553697] [2024-11-07 00:58:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:00,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:00,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:00,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:00,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:00,981 INFO L87 Difference]: Start difference. First operand 17685 states and 28106 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:58:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:04,491 INFO L93 Difference]: Finished difference Result 63419 states and 100039 transitions. [2024-11-07 00:58:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:58:04,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-07 00:58:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:04,648 INFO L225 Difference]: With dead ends: 63419 [2024-11-07 00:58:04,648 INFO L226 Difference]: Without dead ends: 47870 [2024-11-07 00:58:04,698 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 00:58:04,700 INFO L432 NwaCegarLoop]: 4340 mSDtfsCounter, 5006 mSDsluCounter, 17125 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5019 SdHoareTripleChecker+Valid, 21465 SdHoareTripleChecker+Invalid, 2652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:04,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5019 Valid, 21465 Invalid, 2652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 00:58:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47870 states. [2024-11-07 00:58:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47870 to 32634. [2024-11-07 00:58:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32634 states, 29789 states have (on average 1.538856624928665) internal successors, (45841), 29919 states have internal predecessors, (45841), 1941 states have call successors, (1941), 774 states have call predecessors, (1941), 902 states have return successors, (4256), 2068 states have call predecessors, (4256), 1941 states have call successors, (4256) [2024-11-07 00:58:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32634 states to 32634 states and 52038 transitions. [2024-11-07 00:58:06,232 INFO L78 Accepts]: Start accepts. Automaton has 32634 states and 52038 transitions. Word has length 123 [2024-11-07 00:58:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:06,232 INFO L471 AbstractCegarLoop]: Abstraction has 32634 states and 52038 transitions. [2024-11-07 00:58:06,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:58:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 32634 states and 52038 transitions. [2024-11-07 00:58:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:58:06,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:06,249 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:06,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:58:06,249 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:06,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:06,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2074395564, now seen corresponding path program 1 times [2024-11-07 00:58:06,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:06,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090008984] [2024-11-07 00:58:06,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:06,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:06,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:06,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:58:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:58:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:06,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:58:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:06,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:58:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090008984] [2024-11-07 00:58:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090008984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:06,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:06,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292253140] [2024-11-07 00:58:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:06,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:06,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:06,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:06,408 INFO L87 Difference]: Start difference. First operand 32634 states and 52038 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:58:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:11,277 INFO L93 Difference]: Finished difference Result 120870 states and 192805 transitions. [2024-11-07 00:58:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:58:11,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-07 00:58:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:11,613 INFO L225 Difference]: With dead ends: 120870 [2024-11-07 00:58:11,613 INFO L226 Difference]: Without dead ends: 90372 [2024-11-07 00:58:11,726 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 00:58:11,727 INFO L432 NwaCegarLoop]: 4341 mSDtfsCounter, 5156 mSDsluCounter, 17128 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5178 SdHoareTripleChecker+Valid, 21469 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:11,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5178 Valid, 21469 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 00:58:11,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90372 states. [2024-11-07 00:58:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90372 to 62787. [2024-11-07 00:58:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62787 states, 57254 states have (on average 1.5286792189192022) internal successors, (87523), 57512 states have internal predecessors, (87523), 3733 states have call successors, (3733), 1542 states have call predecessors, (3733), 1798 states have return successors, (10550), 3988 states have call predecessors, (10550), 3733 states have call successors, (10550) [2024-11-07 00:58:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62787 states to 62787 states and 101806 transitions. [2024-11-07 00:58:14,653 INFO L78 Accepts]: Start accepts. Automaton has 62787 states and 101806 transitions. Word has length 123 [2024-11-07 00:58:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:14,653 INFO L471 AbstractCegarLoop]: Abstraction has 62787 states and 101806 transitions. [2024-11-07 00:58:14,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:58:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 62787 states and 101806 transitions. [2024-11-07 00:58:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:58:14,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:14,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:14,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:58:14,683 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:14,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash -869186514, now seen corresponding path program 1 times [2024-11-07 00:58:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764888904] [2024-11-07 00:58:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:58:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:58:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:58:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:58:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:14,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:14,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764888904] [2024-11-07 00:58:14,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764888904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:14,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:14,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844832234] [2024-11-07 00:58:14,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:14,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:14,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:14,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:14,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:14,813 INFO L87 Difference]: Start difference. First operand 62787 states and 101806 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:58:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:23,249 INFO L93 Difference]: Finished difference Result 234237 states and 381803 transitions. [2024-11-07 00:58:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:58:23,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-07 00:58:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:23,828 INFO L225 Difference]: With dead ends: 234237 [2024-11-07 00:58:23,828 INFO L226 Difference]: Without dead ends: 173586 [2024-11-07 00:58:24,003 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 00:58:24,004 INFO L432 NwaCegarLoop]: 4341 mSDtfsCounter, 5116 mSDsluCounter, 17128 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5138 SdHoareTripleChecker+Valid, 21469 SdHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:24,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5138 Valid, 21469 Invalid, 2196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 00:58:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173586 states. [2024-11-07 00:58:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173586 to 122964. [2024-11-07 00:58:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122964 states, 112183 states have (on average 1.5244110070153232) internal successors, (171013), 112697 states have internal predecessors, (171013), 7189 states have call successors, (7189), 3078 states have call predecessors, (7189), 3590 states have return successors, (27384), 7700 states have call predecessors, (27384), 7189 states have call successors, (27384) [2024-11-07 00:58:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122964 states to 122964 states and 205586 transitions. [2024-11-07 00:58:31,081 INFO L78 Accepts]: Start accepts. Automaton has 122964 states and 205586 transitions. Word has length 123 [2024-11-07 00:58:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:31,081 INFO L471 AbstractCegarLoop]: Abstraction has 122964 states and 205586 transitions. [2024-11-07 00:58:31,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 00:58:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 122964 states and 205586 transitions. [2024-11-07 00:58:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:58:31,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:31,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:31,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:58:31,144 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:31,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1806805868, now seen corresponding path program 1 times [2024-11-07 00:58:31,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:31,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737246200] [2024-11-07 00:58:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:31,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 00:58:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 00:58:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:58:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:58:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:31,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:31,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737246200] [2024-11-07 00:58:31,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737246200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:31,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:31,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106218105] [2024-11-07 00:58:31,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:31,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:31,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:31,273 INFO L87 Difference]: Start difference. First operand 122964 states and 205586 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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)