./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '3add2c82410ff745811ed91690a644a775913a086eeabc1a421c899bac857c34'] 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_label49+token_ring.04.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3add2c82410ff745811ed91690a644a775913a086eeabc1a421c899bac857c34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:09:34,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:09:34,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:09:34,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:09:34,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:09:34,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:09:34,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:09:34,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:09:34,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:09:34,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:09:34,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:09:34,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:09:34,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:09:34,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:09:34,714 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:09:34,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:09:34,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:09:34,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:09:34,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:09:34,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:09:34,716 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:09:34,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:09:34,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:09:34,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:09:34,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:09:34,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:09:34,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:09:34,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:09:34,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:09:34,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:09:34,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:09:34,717 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 -> 3add2c82410ff745811ed91690a644a775913a086eeabc1a421c899bac857c34 [2024-11-07 01:09:34,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:09:35,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:09:35,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:09:35,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:09:35,010 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:09:35,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-2.c [2024-11-07 01:09:36,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:09:37,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:09:37,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-2.c [2024-11-07 01:09:37,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9f2fb2e4/1a207eb187ad4878b90f92ff4d2fe81e/FLAG51b5198c2 [2024-11-07 01:09:37,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9f2fb2e4/1a207eb187ad4878b90f92ff4d2fe81e [2024-11-07 01:09:37,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:09:37,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:09:37,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:09:37,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:09:37,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:09:37,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:09:37" (1/1) ... [2024-11-07 01:09:37,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309ffeee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:37, skipping insertion in model container [2024-11-07 01:09:37,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:09:37" (1/1) ... [2024-11-07 01:09:37,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:09:38,606 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_label49+token_ring.04.cil-2.c[380593,380606] [2024-11-07 01:09:38,637 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_label49+token_ring.04.cil-2.c[383339,383352] [2024-11-07 01:09:38,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:09:38,852 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:09:39,495 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_label49+token_ring.04.cil-2.c[380593,380606] [2024-11-07 01:09:39,501 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_label49+token_ring.04.cil-2.c[383339,383352] [2024-11-07 01:09:39,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:09:39,592 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:09:39,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39 WrapperNode [2024-11-07 01:09:39,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:09:39,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:09:39,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:09:39,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:09:39,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:39,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:40,091 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 12759 [2024-11-07 01:09:40,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:09:40,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:09:40,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:09:40,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:09:40,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:40,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:40,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:40,289 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:09:40,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:40,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:40,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:40,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:40,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:40,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:40,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:09:40,675 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:09:40,675 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:09:40,675 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:09:40,676 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (1/1) ... [2024-11-07 01:09:40,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:09:40,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:09:40,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:09:40,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:09:40,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:09:40,781 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:09:40,781 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:09:40,781 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:09:40,782 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:09:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:09:40,782 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:09:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 01:09:40,782 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 01:09:40,783 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:09:40,783 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:09:40,783 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:09:40,783 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:09:40,783 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:09:40,783 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:09:40,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:09:40,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:09:40,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:09:40,932 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:09:40,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:09:48,577 INFO L? ?]: Removed 1711 outVars from TransFormulas that were not future-live. [2024-11-07 01:09:48,577 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:09:48,640 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:09:48,641 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-07 01:09:48,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:09:48 BoogieIcfgContainer [2024-11-07 01:09:48,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:09:48,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:09:48,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:09:48,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:09:48,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:09:37" (1/3) ... [2024-11-07 01:09:48,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474df49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:09:48, skipping insertion in model container [2024-11-07 01:09:48,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:39" (2/3) ... [2024-11-07 01:09:48,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474df49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:09:48, skipping insertion in model container [2024-11-07 01:09:48,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:09:48" (3/3) ... [2024-11-07 01:09:48,653 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.04.cil-2.c [2024-11-07 01:09:48,668 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:09:48,668 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:09:48,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:09:48,797 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;@144bcb76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:09:48,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:09:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 2378 states, 2348 states have (on average 1.852640545144804) internal successors, (4350), 2353 states have internal predecessors, (4350), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 01:09:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:09:48,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:48,826 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] [2024-11-07 01:09:48,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:48,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:48,833 INFO L85 PathProgramCache]: Analyzing trace with hash 482633735, now seen corresponding path program 1 times [2024-11-07 01:09:48,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:48,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160358989] [2024-11-07 01:09:48,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:48,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:49,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:09:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:49,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:09:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:49,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:09:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:49,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:09:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:49,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:49,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160358989] [2024-11-07 01:09:49,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160358989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:49,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:49,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:09:49,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306031284] [2024-11-07 01:09:49,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:49,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:09:49,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:49,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:09:49,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:09:49,295 INFO L87 Difference]: Start difference. First operand has 2378 states, 2348 states have (on average 1.852640545144804) internal successors, (4350), 2353 states have internal predecessors, (4350), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:50,234 INFO L93 Difference]: Finished difference Result 4803 states and 8862 transitions. [2024-11-07 01:09:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:09:50,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:09:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:50,268 INFO L225 Difference]: With dead ends: 4803 [2024-11-07 01:09:50,268 INFO L226 Difference]: Without dead ends: 2364 [2024-11-07 01:09:50,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:09:50,279 INFO L432 NwaCegarLoop]: 4210 mSDtfsCounter, 457 mSDsluCounter, 12285 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 16495 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:50,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 16495 Invalid, 465 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:09:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2024-11-07 01:09:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2310. [2024-11-07 01:09:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2282 states have (on average 1.8418054338299736) internal successors, (4203), 2285 states have internal predecessors, (4203), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 01:09:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4241 transitions. [2024-11-07 01:09:50,442 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4241 transitions. Word has length 91 [2024-11-07 01:09:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:50,442 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 4241 transitions. [2024-11-07 01:09:50,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4241 transitions. [2024-11-07 01:09:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:09:50,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:50,450 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] [2024-11-07 01:09:50,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:09:50,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:50,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1084124215, now seen corresponding path program 1 times [2024-11-07 01:09:50,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:50,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472368887] [2024-11-07 01:09:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:50,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:50,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:09:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:50,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:09:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:50,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:09:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:50,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:09:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:50,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472368887] [2024-11-07 01:09:50,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472368887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:50,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:50,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:09:50,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314852807] [2024-11-07 01:09:50,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:50,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:09:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:09:50,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:09:50,798 INFO L87 Difference]: Start difference. First operand 2310 states and 4241 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:52,105 INFO L93 Difference]: Finished difference Result 2774 states and 4962 transitions. [2024-11-07 01:09:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:09:52,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:09:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:52,122 INFO L225 Difference]: With dead ends: 2774 [2024-11-07 01:09:52,123 INFO L226 Difference]: Without dead ends: 2597 [2024-11-07 01:09:52,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:09:52,126 INFO L432 NwaCegarLoop]: 4127 mSDtfsCounter, 4619 mSDsluCounter, 12372 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4630 SdHoareTripleChecker+Valid, 16499 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:52,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4630 Valid, 16499 Invalid, 1010 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [84 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:09:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-11-07 01:09:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2488. [2024-11-07 01:09:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2440 states have (on average 1.8221311475409836) internal successors, (4446), 2444 states have internal predecessors, (4446), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-11-07 01:09:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 4513 transitions. [2024-11-07 01:09:52,232 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 4513 transitions. Word has length 91 [2024-11-07 01:09:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:52,232 INFO L471 AbstractCegarLoop]: Abstraction has 2488 states and 4513 transitions. [2024-11-07 01:09:52,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 4513 transitions. [2024-11-07 01:09:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:09:52,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:52,235 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] [2024-11-07 01:09:52,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:09:52,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:52,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1156138437, now seen corresponding path program 1 times [2024-11-07 01:09:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751753266] [2024-11-07 01:09:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:52,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:09:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:09:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:09:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:09:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:52,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:52,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751753266] [2024-11-07 01:09:52,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751753266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:52,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958875920] [2024-11-07 01:09:52,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:52,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:52,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:52,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:52,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:52,509 INFO L87 Difference]: Start difference. First operand 2488 states and 4513 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:54,180 INFO L93 Difference]: Finished difference Result 3187 states and 5594 transitions. [2024-11-07 01:09:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:09:54,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:09:54,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:54,194 INFO L225 Difference]: With dead ends: 3187 [2024-11-07 01:09:54,195 INFO L226 Difference]: Without dead ends: 2832 [2024-11-07 01:09:54,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 01:09:54,198 INFO L432 NwaCegarLoop]: 4253 mSDtfsCounter, 4620 mSDsluCounter, 16808 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4631 SdHoareTripleChecker+Valid, 21061 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:54,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4631 Valid, 21061 Invalid, 1543 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:09:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2024-11-07 01:09:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2655. [2024-11-07 01:09:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2587 states have (on average 1.8040201005025125) internal successors, (4667), 2592 states have internal predecessors, (4667), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-11-07 01:09:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4762 transitions. [2024-11-07 01:09:54,310 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4762 transitions. Word has length 91 [2024-11-07 01:09:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:54,310 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 4762 transitions. [2024-11-07 01:09:54,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4762 transitions. [2024-11-07 01:09:54,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:09:54,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:54,314 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] [2024-11-07 01:09:54,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:09:54,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:54,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:54,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1404724409, now seen corresponding path program 1 times [2024-11-07 01:09:54,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:54,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798055730] [2024-11-07 01:09:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:54,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:54,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:09:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:09:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:54,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:09:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:54,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:09:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798055730] [2024-11-07 01:09:54,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798055730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:54,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896128057] [2024-11-07 01:09:54,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:54,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:54,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:54,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:54,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:54,561 INFO L87 Difference]: Start difference. First operand 2655 states and 4762 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:55,871 INFO L93 Difference]: Finished difference Result 3795 states and 6521 transitions. [2024-11-07 01:09:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:09:55,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:09:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:55,887 INFO L225 Difference]: With dead ends: 3795 [2024-11-07 01:09:55,887 INFO L226 Difference]: Without dead ends: 3273 [2024-11-07 01:09:55,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:09:55,891 INFO L432 NwaCegarLoop]: 4137 mSDtfsCounter, 4670 mSDsluCounter, 16482 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4681 SdHoareTripleChecker+Valid, 20619 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:55,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4681 Valid, 20619 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:09:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2024-11-07 01:09:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 2990. [2024-11-07 01:09:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2882 states have (on average 1.7730742539902846) internal successors, (5110), 2889 states have internal predecessors, (5110), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-11-07 01:09:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 5265 transitions. [2024-11-07 01:09:56,032 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 5265 transitions. Word has length 91 [2024-11-07 01:09:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:56,033 INFO L471 AbstractCegarLoop]: Abstraction has 2990 states and 5265 transitions. [2024-11-07 01:09:56,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 5265 transitions. [2024-11-07 01:09:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:09:56,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:56,039 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] [2024-11-07 01:09:56,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:09:56,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:56,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -517501563, now seen corresponding path program 1 times [2024-11-07 01:09:56,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:56,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196741885] [2024-11-07 01:09:56,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:56,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:09:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:09:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:09:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:09:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,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 01:09:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:56,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196741885] [2024-11-07 01:09:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196741885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:56,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:56,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:56,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937565719] [2024-11-07 01:09:56,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:56,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:56,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:56,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:56,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:56,265 INFO L87 Difference]: Start difference. First operand 2990 states and 5265 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:57,664 INFO L93 Difference]: Finished difference Result 4970 states and 8308 transitions. [2024-11-07 01:09:57,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:09:57,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:09:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:57,680 INFO L225 Difference]: With dead ends: 4970 [2024-11-07 01:09:57,681 INFO L226 Difference]: Without dead ends: 4113 [2024-11-07 01:09:57,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:09:57,686 INFO L432 NwaCegarLoop]: 4251 mSDtfsCounter, 4618 mSDsluCounter, 16808 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4629 SdHoareTripleChecker+Valid, 21059 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:57,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4629 Valid, 21059 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:09:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2024-11-07 01:09:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3661. [2024-11-07 01:09:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3661 states, 3473 states have (on average 1.7264612726749209) internal successors, (5996), 3484 states have internal predecessors, (5996), 124 states have call successors, (124), 55 states have call predecessors, (124), 62 states have return successors, (157), 129 states have call predecessors, (157), 122 states have call successors, (157) [2024-11-07 01:09:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 6277 transitions. [2024-11-07 01:09:57,810 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 6277 transitions. Word has length 91 [2024-11-07 01:09:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:57,811 INFO L471 AbstractCegarLoop]: Abstraction has 3661 states and 6277 transitions. [2024-11-07 01:09:57,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 6277 transitions. [2024-11-07 01:09:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:09:57,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:57,816 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] [2024-11-07 01:09:57,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:09:57,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:57,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:57,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1866423175, now seen corresponding path program 1 times [2024-11-07 01:09:57,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:57,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060253779] [2024-11-07 01:09:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:57,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:57,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:57,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:09:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:57,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:09:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:57,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:09:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:57,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:09:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:57,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:57,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060253779] [2024-11-07 01:09:57,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060253779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:57,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:57,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:57,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928433596] [2024-11-07 01:09:57,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:57,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:57,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:57,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:57,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:57,968 INFO L87 Difference]: Start difference. First operand 3661 states and 6277 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:59,281 INFO L93 Difference]: Finished difference Result 7832 states and 12656 transitions. [2024-11-07 01:09:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:09:59,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:09:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:59,312 INFO L225 Difference]: With dead ends: 7832 [2024-11-07 01:09:59,312 INFO L226 Difference]: Without dead ends: 6304 [2024-11-07 01:09:59,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:09:59,322 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 4788 mSDsluCounter, 16800 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4804 SdHoareTripleChecker+Valid, 21049 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:59,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4804 Valid, 21049 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:09:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2024-11-07 01:09:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 4993. [2024-11-07 01:09:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4993 states, 4653 states have (on average 1.6711798839458414) internal successors, (7776), 4672 states have internal predecessors, (7776), 220 states have call successors, (220), 103 states have call predecessors, (220), 118 states have return successors, (315), 233 states have call predecessors, (315), 218 states have call successors, (315) [2024-11-07 01:09:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4993 states to 4993 states and 8311 transitions. [2024-11-07 01:09:59,551 INFO L78 Accepts]: Start accepts. Automaton has 4993 states and 8311 transitions. Word has length 91 [2024-11-07 01:09:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:59,551 INFO L471 AbstractCegarLoop]: Abstraction has 4993 states and 8311 transitions. [2024-11-07 01:09:59,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4993 states and 8311 transitions. [2024-11-07 01:09:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:09:59,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:59,556 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] [2024-11-07 01:09:59,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:09:59,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:59,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash 899072521, now seen corresponding path program 1 times [2024-11-07 01:09:59,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:59,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598912632] [2024-11-07 01:09:59,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:59,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:59,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:09:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:59,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:09:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:59,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:09:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:59,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:09:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:59,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:59,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598912632] [2024-11-07 01:09:59,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598912632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:59,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:59,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:59,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200729696] [2024-11-07 01:09:59,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:59,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:59,719 INFO L87 Difference]: Start difference. First operand 4993 states and 8311 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:01,239 INFO L93 Difference]: Finished difference Result 12790 states and 20272 transitions. [2024-11-07 01:10:01,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:10:01,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:10:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:01,286 INFO L225 Difference]: With dead ends: 12790 [2024-11-07 01:10:01,287 INFO L226 Difference]: Without dead ends: 9930 [2024-11-07 01:10:01,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:10:01,301 INFO L432 NwaCegarLoop]: 4248 mSDtfsCounter, 4645 mSDsluCounter, 16797 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 21045 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:01,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 21045 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:10:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9930 states. [2024-11-07 01:10:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9930 to 7486. [2024-11-07 01:10:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7486 states, 6850 states have (on average 1.6131386861313868) internal successors, (11050), 6885 states have internal predecessors, (11050), 404 states have call successors, (404), 199 states have call predecessors, (404), 230 states have return successors, (677), 433 states have call predecessors, (677), 402 states have call successors, (677) [2024-11-07 01:10:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7486 states to 7486 states and 12131 transitions. [2024-11-07 01:10:01,653 INFO L78 Accepts]: Start accepts. Automaton has 7486 states and 12131 transitions. Word has length 91 [2024-11-07 01:10:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:01,654 INFO L471 AbstractCegarLoop]: Abstraction has 7486 states and 12131 transitions. [2024-11-07 01:10:01,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 7486 states and 12131 transitions. [2024-11-07 01:10:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:10:01,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:01,663 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] [2024-11-07 01:10:01,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:10:01,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:01,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1487436985, now seen corresponding path program 1 times [2024-11-07 01:10:01,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:01,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619256009] [2024-11-07 01:10:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:01,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:01,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:01,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:10:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:01,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:10:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:01,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:10:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:01,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:10:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:01,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619256009] [2024-11-07 01:10:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619256009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:01,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:01,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:01,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782822907] [2024-11-07 01:10:01,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:01,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:01,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:01,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:01,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:01,823 INFO L87 Difference]: Start difference. First operand 7486 states and 12131 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:03,515 INFO L93 Difference]: Finished difference Result 21929 states and 34366 transitions. [2024-11-07 01:10:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:10:03,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:10:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:03,593 INFO L225 Difference]: With dead ends: 21929 [2024-11-07 01:10:03,593 INFO L226 Difference]: Without dead ends: 16576 [2024-11-07 01:10:03,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:10:03,621 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 4708 mSDsluCounter, 16800 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4724 SdHoareTripleChecker+Valid, 21049 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:03,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4724 Valid, 21049 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:10:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16576 states. [2024-11-07 01:10:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16576 to 12615. [2024-11-07 01:10:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12615 states, 11403 states have (on average 1.5697623432430061) internal successors, (17900), 11470 states have internal predecessors, (17900), 756 states have call successors, (756), 391 states have call predecessors, (756), 454 states have return successors, (1547), 817 states have call predecessors, (1547), 754 states have call successors, (1547) [2024-11-07 01:10:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12615 states to 12615 states and 20203 transitions. [2024-11-07 01:10:04,341 INFO L78 Accepts]: Start accepts. Automaton has 12615 states and 20203 transitions. Word has length 91 [2024-11-07 01:10:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:04,342 INFO L471 AbstractCegarLoop]: Abstraction has 12615 states and 20203 transitions. [2024-11-07 01:10:04,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 12615 states and 20203 transitions. [2024-11-07 01:10:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:10:04,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:04,354 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] [2024-11-07 01:10:04,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:10:04,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:04,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1980063159, now seen corresponding path program 1 times [2024-11-07 01:10:04,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:04,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184051390] [2024-11-07 01:10:04,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:04,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:04,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:04,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:10:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:04,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:10:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:04,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:10:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:04,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:10:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184051390] [2024-11-07 01:10:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184051390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:04,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183107085] [2024-11-07 01:10:04,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:04,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:04,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:04,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:04,512 INFO L87 Difference]: Start difference. First operand 12615 states and 20203 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:06,740 INFO L93 Difference]: Finished difference Result 40064 states and 63092 transitions. [2024-11-07 01:10:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:10:06,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:10:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:06,854 INFO L225 Difference]: With dead ends: 40064 [2024-11-07 01:10:06,854 INFO L226 Difference]: Without dead ends: 29582 [2024-11-07 01:10:06,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:10:06,892 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 4668 mSDsluCounter, 16800 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4684 SdHoareTripleChecker+Valid, 21049 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:06,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4684 Valid, 21049 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:10:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29582 states. [2024-11-07 01:10:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29582 to 22840. [2024-11-07 01:10:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22840 states, 20508 states have (on average 1.5423249463623951) internal successors, (31630), 20639 states have internal predecessors, (31630), 1428 states have call successors, (1428), 775 states have call predecessors, (1428), 902 states have return successors, (3741), 1553 states have call predecessors, (3741), 1426 states have call successors, (3741) [2024-11-07 01:10:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22840 states to 22840 states and 36799 transitions. [2024-11-07 01:10:08,144 INFO L78 Accepts]: Start accepts. Automaton has 22840 states and 36799 transitions. Word has length 91 [2024-11-07 01:10:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:08,145 INFO L471 AbstractCegarLoop]: Abstraction has 22840 states and 36799 transitions. [2024-11-07 01:10:08,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 22840 states and 36799 transitions. [2024-11-07 01:10:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:10:08,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:08,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] [2024-11-07 01:10:08,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:10:08,164 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:08,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:08,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1026123001, now seen corresponding path program 1 times [2024-11-07 01:10:08,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:08,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488513655] [2024-11-07 01:10:08,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:08,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:10:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:08,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:10:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:08,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:10:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:08,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:10:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:08,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:08,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488513655] [2024-11-07 01:10:08,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488513655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:08,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:08,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:08,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270019222] [2024-11-07 01:10:08,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:08,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:08,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:08,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:08,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:08,296 INFO L87 Difference]: Start difference. First operand 22840 states and 36799 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:11,941 INFO L93 Difference]: Finished difference Result 75079 states and 120530 transitions. [2024-11-07 01:10:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:10:11,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:10:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:12,186 INFO L225 Difference]: With dead ends: 75079 [2024-11-07 01:10:12,187 INFO L226 Difference]: Without dead ends: 54372 [2024-11-07 01:10:12,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:10:12,264 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 4610 mSDsluCounter, 16785 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 21023 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:12,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4620 Valid, 21023 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:10:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54372 states. [2024-11-07 01:10:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54372 to 43201. [2024-11-07 01:10:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43201 states, 38709 states have (on average 1.5279134051512568) internal successors, (59144), 38968 states have internal predecessors, (59144), 2700 states have call successors, (2700), 1535 states have call predecessors, (2700), 1790 states have return successors, (9515), 2953 states have call predecessors, (9515), 2698 states have call successors, (9515) [2024-11-07 01:10:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43201 states to 43201 states and 71359 transitions. [2024-11-07 01:10:14,786 INFO L78 Accepts]: Start accepts. Automaton has 43201 states and 71359 transitions. Word has length 91 [2024-11-07 01:10:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:14,788 INFO L471 AbstractCegarLoop]: Abstraction has 43201 states and 71359 transitions. [2024-11-07 01:10:14,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 43201 states and 71359 transitions. [2024-11-07 01:10:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:10:14,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:14,823 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] [2024-11-07 01:10:14,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:10:14,823 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:14,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2052690569, now seen corresponding path program 1 times [2024-11-07 01:10:14,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:14,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115605039] [2024-11-07 01:10:14,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:14,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:14,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:10:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:14,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:10:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:14,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:10:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:14,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:10:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:14,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:14,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115605039] [2024-11-07 01:10:14,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115605039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:14,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:14,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:10:14,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887175149] [2024-11-07 01:10:14,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:14,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:10:14,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:14,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:10:14,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:10:14,938 INFO L87 Difference]: Start difference. First operand 43201 states and 71359 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:19,901 INFO L93 Difference]: Finished difference Result 117999 states and 191198 transitions. [2024-11-07 01:10:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:10:19,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:10:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:20,193 INFO L225 Difference]: With dead ends: 117999 [2024-11-07 01:10:20,193 INFO L226 Difference]: Without dead ends: 76932 [2024-11-07 01:10:20,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:10:20,306 INFO L432 NwaCegarLoop]: 4276 mSDtfsCounter, 4816 mSDsluCounter, 12469 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4845 SdHoareTripleChecker+Valid, 16745 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:20,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4845 Valid, 16745 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:10:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76932 states. [2024-11-07 01:10:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76932 to 63237. [2024-11-07 01:10:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63237 states, 56421 states have (on average 1.5080555112458127) internal successors, (85086), 56937 states have internal predecessors, (85086), 4122 states have call successors, (4122), 2309 states have call predecessors, (4122), 2692 states have return successors, (13125), 4246 states have call predecessors, (13125), 4120 states have call successors, (13125) [2024-11-07 01:10:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63237 states to 63237 states and 102333 transitions. [2024-11-07 01:10:23,707 INFO L78 Accepts]: Start accepts. Automaton has 63237 states and 102333 transitions. Word has length 91 [2024-11-07 01:10:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:23,707 INFO L471 AbstractCegarLoop]: Abstraction has 63237 states and 102333 transitions. [2024-11-07 01:10:23,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 63237 states and 102333 transitions. [2024-11-07 01:10:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 01:10:23,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:23,899 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:23,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:10:23,899 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:23,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1980373666, now seen corresponding path program 1 times [2024-11-07 01:10:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:23,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467908673] [2024-11-07 01:10:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:10:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:24,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:10:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:24,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:10:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:24,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:10:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 01:10:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:24,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:10:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:24,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 01:10:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 01:10:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467908673] [2024-11-07 01:10:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467908673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:10:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565836193] [2024-11-07 01:10:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:24,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:10:24,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:10:24,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:10:24,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 01:10:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:24,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:10:24,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:10:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-07 01:10:24,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:10:24,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565836193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:24,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:10:24,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 01:10:24,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617201666] [2024-11-07 01:10:24,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:24,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:10:24,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:24,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:10:24,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:10:24,403 INFO L87 Difference]: Start difference. First operand 63237 states and 102333 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)