./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '5ee0afe9c2a2e5e350a29156a4a7c18a224cec42ab7ff37fc9f10d35d9e173ae'] 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_label46+token_ring.05.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ee0afe9c2a2e5e350a29156a4a7c18a224cec42ab7ff37fc9f10d35d9e173ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:05:06,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:05:06,739 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:05:06,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:05:06,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:05:06,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:05:06,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:05:06,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:05:06,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:05:06,764 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:05:06,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:05:06,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:05:06,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:05:06,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:05:06,764 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:05:06,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:05:06,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:05:06,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:05:06,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:05:06,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:05:06,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:05:06,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:05:06,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:05:06,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:05:06,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:05:06,765 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:05:06,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:05:06,765 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:05:06,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:05:06,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:05:06,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:05:06,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:05:06,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:05:06,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:05:06,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:05:06,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:05:06,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:05:06,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:05:06,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:05:06,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:05:06,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:05:06,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:05:06,767 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 -> 5ee0afe9c2a2e5e350a29156a4a7c18a224cec42ab7ff37fc9f10d35d9e173ae [2024-11-07 01:05:06,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:05:06,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:05:06,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:05:06,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:05:06,974 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:05:06,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-1.c [2024-11-07 01:05:08,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:05:08,507 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:05:08,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-1.c [2024-11-07 01:05:08,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcd40b1b4/a5a0d68840394b0f93c4b5e0d1faddb8/FLAG181f4bfa0 [2024-11-07 01:05:08,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcd40b1b4/a5a0d68840394b0f93c4b5e0d1faddb8 [2024-11-07 01:05:08,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:05:08,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:05:08,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:05:08,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:05:08,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:05:08,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:08" (1/1) ... [2024-11-07 01:05:08,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d35c7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:08, skipping insertion in model container [2024-11-07 01:05:08,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:08" (1/1) ... [2024-11-07 01:05:08,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:05:09,821 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_label46+token_ring.05.cil-1.c[382357,382370] [2024-11-07 01:05:09,842 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_label46+token_ring.05.cil-1.c[383339,383352] [2024-11-07 01:05:09,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:05:09,971 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:05:10,488 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_label46+token_ring.05.cil-1.c[382357,382370] [2024-11-07 01:05:10,491 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_label46+token_ring.05.cil-1.c[383339,383352] [2024-11-07 01:05:10,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:05:10,544 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:05:10,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10 WrapperNode [2024-11-07 01:05:10,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:05:10,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:05:10,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:05:10,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:05:10,550 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:05:10" (1/1) ... [2024-11-07 01:05:10,627 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:05:10" (1/1) ... [2024-11-07 01:05:10,967 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12813 [2024-11-07 01:05:10,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:05:10,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:05:10,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:05:10,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:05:10,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10" (1/1) ... [2024-11-07 01:05:10,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10" (1/1) ... [2024-11-07 01:05:11,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10" (1/1) ... [2024-11-07 01:05:11,105 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:05:11,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10" (1/1) ... [2024-11-07 01:05:11,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10" (1/1) ... [2024-11-07 01:05:11,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10" (1/1) ... [2024-11-07 01:05:11,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10" (1/1) ... [2024-11-07 01:05:11,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10" (1/1) ... [2024-11-07 01:05:11,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10" (1/1) ... [2024-11-07 01:05:11,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:05:11,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:05:11,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:05:11,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:05:11,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10" (1/1) ... [2024-11-07 01:05:11,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:05:11,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:05:11,470 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:05:11,479 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:05:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:05:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:05:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:05:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:05:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:05:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:05:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:05:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:05:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:05:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:05:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:05:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:05:11,502 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:05:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:05:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:05:11,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:05:11,637 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:05:11,638 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:05:17,326 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2024-11-07 01:05:17,326 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:05:17,377 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:05:17,377 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-07 01:05:17,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:17 BoogieIcfgContainer [2024-11-07 01:05:17,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:05:17,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:05:17,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:05:17,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:05:17,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:08" (1/3) ... [2024-11-07 01:05:17,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676c7531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:17, skipping insertion in model container [2024-11-07 01:05:17,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:10" (2/3) ... [2024-11-07 01:05:17,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676c7531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:17, skipping insertion in model container [2024-11-07 01:05:17,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:17" (3/3) ... [2024-11-07 01:05:17,386 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.05.cil-1.c [2024-11-07 01:05:17,396 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:05:17,396 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:05:17,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:05:17,495 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;@65980597, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:05:17,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:05:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 2396 states, 2368 states have (on average 1.8505067567567568) internal successors, (4382), 2371 states have internal predecessors, (4382), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 01:05:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:17,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:17,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:17,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:17,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:17,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1103952823, now seen corresponding path program 1 times [2024-11-07 01:05:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901854055] [2024-11-07 01:05:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:17,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,846 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:05:17,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:17,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901854055] [2024-11-07 01:05:17,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901854055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:17,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:17,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:05:17,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359520029] [2024-11-07 01:05:17,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:17,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:05:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:17,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:05:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:05:17,872 INFO L87 Difference]: Start difference. First operand has 2396 states, 2368 states have (on average 1.8505067567567568) internal successors, (4382), 2371 states have internal predecessors, (4382), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:18,588 INFO L93 Difference]: Finished difference Result 4849 states and 8937 transitions. [2024-11-07 01:05:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:05:18,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:18,610 INFO L225 Difference]: With dead ends: 4849 [2024-11-07 01:05:18,610 INFO L226 Difference]: Without dead ends: 2394 [2024-11-07 01:05:18,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:18,623 INFO L432 NwaCegarLoop]: 4222 mSDtfsCounter, 517 mSDsluCounter, 12295 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 16517 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:18,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 16517 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:05:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2024-11-07 01:05:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2329. [2024-11-07 01:05:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2302 states have (on average 1.8388357949609035) internal successors, (4233), 2304 states have internal predecessors, (4233), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 01:05:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 4271 transitions. [2024-11-07 01:05:18,740 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 4271 transitions. Word has length 101 [2024-11-07 01:05:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:18,740 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 4271 transitions. [2024-11-07 01:05:18,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 4271 transitions. [2024-11-07 01:05:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:18,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:18,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:18,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:05:18,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:18,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash -773110407, now seen corresponding path program 1 times [2024-11-07 01:05:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236087174] [2024-11-07 01:05:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:18,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:18,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:18,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:19,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:19,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:19,014 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:05:19,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:19,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236087174] [2024-11-07 01:05:19,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236087174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:19,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:19,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:05:19,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919646267] [2024-11-07 01:05:19,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:19,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:05:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:05:19,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:05:19,019 INFO L87 Difference]: Start difference. First operand 2329 states and 4271 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:20,147 INFO L93 Difference]: Finished difference Result 2853 states and 5090 transitions. [2024-11-07 01:05:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:05:20,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:20,161 INFO L225 Difference]: With dead ends: 2853 [2024-11-07 01:05:20,161 INFO L226 Difference]: Without dead ends: 2658 [2024-11-07 01:05:20,163 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:05:20,164 INFO L432 NwaCegarLoop]: 4137 mSDtfsCounter, 4719 mSDsluCounter, 12401 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 16538 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:20,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 16538 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-11-07 01:05:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2529. [2024-11-07 01:05:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2481 states have (on average 1.8170092704554615) internal successors, (4508), 2484 states have internal predecessors, (4508), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-11-07 01:05:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 4577 transitions. [2024-11-07 01:05:20,250 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 4577 transitions. Word has length 101 [2024-11-07 01:05:20,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:20,251 INFO L471 AbstractCegarLoop]: Abstraction has 2529 states and 4577 transitions. [2024-11-07 01:05:20,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 4577 transitions. [2024-11-07 01:05:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:20,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:20,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:20,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:05:20,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:20,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1804972285, now seen corresponding path program 1 times [2024-11-07 01:05:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:20,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503069228] [2024-11-07 01:05:20,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,455 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:05:20,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:20,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503069228] [2024-11-07 01:05:20,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503069228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:20,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:20,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:20,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769938713] [2024-11-07 01:05:20,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:20,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:20,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:20,458 INFO L87 Difference]: Start difference. First operand 2529 states and 4577 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:22,032 INFO L93 Difference]: Finished difference Result 3323 states and 5813 transitions. [2024-11-07 01:05:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:05:22,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:22,043 INFO L225 Difference]: With dead ends: 3323 [2024-11-07 01:05:22,043 INFO L226 Difference]: Without dead ends: 2928 [2024-11-07 01:05:22,045 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:05:22,046 INFO L432 NwaCegarLoop]: 4269 mSDtfsCounter, 4734 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4746 SdHoareTripleChecker+Valid, 21131 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:22,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4746 Valid, 21131 Invalid, 1789 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:05:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2024-11-07 01:05:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2716. [2024-11-07 01:05:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2647 states have (on average 1.797128825085002) internal successors, (4757), 2651 states have internal predecessors, (4757), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-11-07 01:05:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 4856 transitions. [2024-11-07 01:05:22,123 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 4856 transitions. Word has length 101 [2024-11-07 01:05:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:22,123 INFO L471 AbstractCegarLoop]: Abstraction has 2716 states and 4856 transitions. [2024-11-07 01:05:22,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 4856 transitions. [2024-11-07 01:05:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:22,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:22,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:22,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:05:22,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:22,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:22,126 INFO L85 PathProgramCache]: Analyzing trace with hash -74158661, now seen corresponding path program 1 times [2024-11-07 01:05:22,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:22,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162971204] [2024-11-07 01:05:22,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:22,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:22,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:22,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:22,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:22,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:22,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:05:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:22,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162971204] [2024-11-07 01:05:22,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162971204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:22,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:22,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259238323] [2024-11-07 01:05:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:22,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:22,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:22,296 INFO L87 Difference]: Start difference. First operand 2716 states and 4856 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:23,660 INFO L93 Difference]: Finished difference Result 4014 states and 6872 transitions. [2024-11-07 01:05:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:05:23,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:23,722 INFO L225 Difference]: With dead ends: 4014 [2024-11-07 01:05:23,722 INFO L226 Difference]: Without dead ends: 3432 [2024-11-07 01:05:23,723 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:05:23,724 INFO L432 NwaCegarLoop]: 4267 mSDtfsCounter, 4728 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 21129 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:23,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 21129 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:05:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2024-11-07 01:05:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3094. [2024-11-07 01:05:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2983 states have (on average 1.763995977204157) internal successors, (5262), 2989 states have internal predecessors, (5262), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-11-07 01:05:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 5425 transitions. [2024-11-07 01:05:23,805 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 5425 transitions. Word has length 101 [2024-11-07 01:05:23,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:23,805 INFO L471 AbstractCegarLoop]: Abstraction has 3094 states and 5425 transitions. [2024-11-07 01:05:23,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 5425 transitions. [2024-11-07 01:05:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:23,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:23,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:23,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:05:23,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:23,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1492599289, now seen corresponding path program 1 times [2024-11-07 01:05:23,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:23,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169739444] [2024-11-07 01:05:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:23,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,945 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:05:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169739444] [2024-11-07 01:05:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169739444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:23,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:23,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107404775] [2024-11-07 01:05:23,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:23,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:23,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:23,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:23,946 INFO L87 Difference]: Start difference. First operand 3094 states and 5425 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:25,108 INFO L93 Difference]: Finished difference Result 5354 states and 8917 transitions. [2024-11-07 01:05:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:05:25,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:25,121 INFO L225 Difference]: With dead ends: 5354 [2024-11-07 01:05:25,121 INFO L226 Difference]: Without dead ends: 4394 [2024-11-07 01:05:25,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:05:25,125 INFO L432 NwaCegarLoop]: 4267 mSDtfsCounter, 4727 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4739 SdHoareTripleChecker+Valid, 21129 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:25,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4739 Valid, 21129 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4394 states. [2024-11-07 01:05:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4394 to 3851. [2024-11-07 01:05:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3656 states have (on average 1.7155361050328228) internal successors, (6272), 3666 states have internal predecessors, (6272), 131 states have call successors, (131), 54 states have call predecessors, (131), 62 states have return successors, (166), 138 states have call predecessors, (166), 131 states have call successors, (166) [2024-11-07 01:05:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 6569 transitions. [2024-11-07 01:05:25,230 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 6569 transitions. Word has length 101 [2024-11-07 01:05:25,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:25,230 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 6569 transitions. [2024-11-07 01:05:25,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 6569 transitions. [2024-11-07 01:05:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:25,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:25,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:05:25,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:25,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:25,235 INFO L85 PathProgramCache]: Analyzing trace with hash 434761211, now seen corresponding path program 1 times [2024-11-07 01:05:25,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:25,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89322660] [2024-11-07 01:05:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:25,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,362 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:05:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89322660] [2024-11-07 01:05:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89322660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:25,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218855676] [2024-11-07 01:05:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:25,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:25,364 INFO L87 Difference]: Start difference. First operand 3851 states and 6569 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:26,573 INFO L93 Difference]: Finished difference Result 8033 states and 13023 transitions. [2024-11-07 01:05:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:05:26,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:26,590 INFO L225 Difference]: With dead ends: 8033 [2024-11-07 01:05:26,590 INFO L226 Difference]: Without dead ends: 6316 [2024-11-07 01:05:26,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:05:26,594 INFO L432 NwaCegarLoop]: 4267 mSDtfsCounter, 4726 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4738 SdHoareTripleChecker+Valid, 21129 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:26,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4738 Valid, 21129 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6316 states. [2024-11-07 01:05:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6316 to 5372. [2024-11-07 01:05:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5372 states, 5009 states have (on average 1.657416650029946) internal successors, (8302), 5027 states have internal predecessors, (8302), 243 states have call successors, (243), 102 states have call predecessors, (243), 118 states have return successors, (340), 258 states have call predecessors, (340), 243 states have call successors, (340) [2024-11-07 01:05:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 8885 transitions. [2024-11-07 01:05:26,738 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 8885 transitions. Word has length 101 [2024-11-07 01:05:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:26,739 INFO L471 AbstractCegarLoop]: Abstraction has 5372 states and 8885 transitions. [2024-11-07 01:05:26,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 8885 transitions. [2024-11-07 01:05:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:26,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:26,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:26,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:05:26,743 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:26,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash -707741255, now seen corresponding path program 1 times [2024-11-07 01:05:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:26,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178125037] [2024-11-07 01:05:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:26,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:26,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:26,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:26,869 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:05:26,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178125037] [2024-11-07 01:05:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178125037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:26,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238813988] [2024-11-07 01:05:26,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:26,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:26,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:26,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:26,871 INFO L87 Difference]: Start difference. First operand 5372 states and 8885 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:28,176 INFO L93 Difference]: Finished difference Result 14656 states and 23187 transitions. [2024-11-07 01:05:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:28,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:28,212 INFO L225 Difference]: With dead ends: 14656 [2024-11-07 01:05:28,212 INFO L226 Difference]: Without dead ends: 11418 [2024-11-07 01:05:28,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:05:28,223 INFO L432 NwaCegarLoop]: 4149 mSDtfsCounter, 4988 mSDsluCounter, 16518 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5006 SdHoareTripleChecker+Valid, 20667 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:28,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5006 Valid, 20667 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:05:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11418 states. [2024-11-07 01:05:28,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11418 to 8381. [2024-11-07 01:05:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8381 states, 7698 states have (on average 1.6045726162639646) internal successors, (12352), 7732 states have internal predecessors, (12352), 451 states have call successors, (451), 198 states have call predecessors, (451), 230 states have return successors, (726), 482 states have call predecessors, (726), 451 states have call successors, (726) [2024-11-07 01:05:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 13529 transitions. [2024-11-07 01:05:28,569 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 13529 transitions. Word has length 101 [2024-11-07 01:05:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:28,569 INFO L471 AbstractCegarLoop]: Abstraction has 8381 states and 13529 transitions. [2024-11-07 01:05:28,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 13529 transitions. [2024-11-07 01:05:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:28,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:28,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:28,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:05:28,576 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:28,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:28,577 INFO L85 PathProgramCache]: Analyzing trace with hash -467501509, now seen corresponding path program 1 times [2024-11-07 01:05:28,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:28,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712733225] [2024-11-07 01:05:28,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:28,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,690 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:05:28,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:28,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712733225] [2024-11-07 01:05:28,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712733225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:28,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:28,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:28,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602406547] [2024-11-07 01:05:28,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:28,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:28,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:28,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:28,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:28,691 INFO L87 Difference]: Start difference. First operand 8381 states and 13529 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:30,481 INFO L93 Difference]: Finished difference Result 26111 states and 41017 transitions. [2024-11-07 01:05:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:30,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:30,553 INFO L225 Difference]: With dead ends: 26111 [2024-11-07 01:05:30,553 INFO L226 Difference]: Without dead ends: 19864 [2024-11-07 01:05:30,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:05:30,573 INFO L432 NwaCegarLoop]: 4264 mSDtfsCounter, 4766 mSDsluCounter, 16851 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 21115 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:30,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 21115 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:05:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19864 states. [2024-11-07 01:05:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19864 to 14222. [2024-11-07 01:05:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14222 states, 12915 states have (on average 1.564847077042199) internal successors, (20210), 12981 states have internal predecessors, (20210), 851 states have call successors, (851), 390 states have call predecessors, (851), 454 states have return successors, (1644), 914 states have call predecessors, (1644), 851 states have call successors, (1644) [2024-11-07 01:05:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14222 states to 14222 states and 22705 transitions. [2024-11-07 01:05:31,250 INFO L78 Accepts]: Start accepts. Automaton has 14222 states and 22705 transitions. Word has length 101 [2024-11-07 01:05:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:31,250 INFO L471 AbstractCegarLoop]: Abstraction has 14222 states and 22705 transitions. [2024-11-07 01:05:31,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 14222 states and 22705 transitions. [2024-11-07 01:05:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:31,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:31,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:31,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:05:31,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:31,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash 371532153, now seen corresponding path program 1 times [2024-11-07 01:05:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:31,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611584429] [2024-11-07 01:05:31,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:31,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:31,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:31,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:31,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:31,392 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:05:31,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:31,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611584429] [2024-11-07 01:05:31,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611584429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:31,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:31,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:31,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548586170] [2024-11-07 01:05:31,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:31,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:31,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:31,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:31,394 INFO L87 Difference]: Start difference. First operand 14222 states and 22705 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:33,527 INFO L93 Difference]: Finished difference Result 47950 states and 75583 transitions. [2024-11-07 01:05:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:33,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:33,642 INFO L225 Difference]: With dead ends: 47950 [2024-11-07 01:05:33,643 INFO L226 Difference]: Without dead ends: 35862 [2024-11-07 01:05:33,689 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:05:33,690 INFO L432 NwaCegarLoop]: 4265 mSDtfsCounter, 4858 mSDsluCounter, 16854 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4876 SdHoareTripleChecker+Valid, 21119 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:33,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4876 Valid, 21119 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35862 states. [2024-11-07 01:05:34,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35862 to 26031. [2024-11-07 01:05:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26031 states, 23508 states have (on average 1.5404117747149906) internal successors, (36212), 23638 states have internal predecessors, (36212), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 902 states have return successors, (3934), 1746 states have call predecessors, (3934), 1619 states have call successors, (3934) [2024-11-07 01:05:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26031 states to 26031 states and 41765 transitions. [2024-11-07 01:05:34,834 INFO L78 Accepts]: Start accepts. Automaton has 26031 states and 41765 transitions. Word has length 101 [2024-11-07 01:05:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:34,835 INFO L471 AbstractCegarLoop]: Abstraction has 26031 states and 41765 transitions. [2024-11-07 01:05:34,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 26031 states and 41765 transitions. [2024-11-07 01:05:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:34,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:34,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:34,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:05:34,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:34,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash 398597755, now seen corresponding path program 1 times [2024-11-07 01:05:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:34,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090746174] [2024-11-07 01:05:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,949 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:05:34,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:34,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090746174] [2024-11-07 01:05:34,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090746174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:34,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:34,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:34,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761465470] [2024-11-07 01:05:34,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:34,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:34,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:34,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:34,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:34,951 INFO L87 Difference]: Start difference. First operand 26031 states and 41765 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:38,696 INFO L93 Difference]: Finished difference Result 90861 states and 145477 transitions. [2024-11-07 01:05:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:38,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:38,917 INFO L225 Difference]: With dead ends: 90861 [2024-11-07 01:05:38,917 INFO L226 Difference]: Without dead ends: 66964 [2024-11-07 01:05:38,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:05:38,982 INFO L432 NwaCegarLoop]: 4265 mSDtfsCounter, 4824 mSDsluCounter, 16854 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4842 SdHoareTripleChecker+Valid, 21119 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:38,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4842 Valid, 21119 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66964 states. [2024-11-07 01:05:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66964 to 49584. [2024-11-07 01:05:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49584 states, 44693 states have (on average 1.5277112746962611) internal successors, (68278), 44951 states have internal predecessors, (68278), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 1798 states have return successors, (9908), 3346 states have call predecessors, (9908), 3091 states have call successors, (9908) [2024-11-07 01:05:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49584 states to 49584 states and 81277 transitions. [2024-11-07 01:05:41,344 INFO L78 Accepts]: Start accepts. Automaton has 49584 states and 81277 transitions. Word has length 101 [2024-11-07 01:05:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:41,344 INFO L471 AbstractCegarLoop]: Abstraction has 49584 states and 81277 transitions. [2024-11-07 01:05:41,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:41,344 INFO L276 IsEmpty]: Start isEmpty. Operand 49584 states and 81277 transitions. [2024-11-07 01:05:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:41,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:41,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:41,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:05:41,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:41,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:41,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1678739143, now seen corresponding path program 1 times [2024-11-07 01:05:41,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:41,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433180198] [2024-11-07 01:05:41,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:41,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,498 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:05:41,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:41,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433180198] [2024-11-07 01:05:41,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433180198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:41,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:41,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:41,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697458361] [2024-11-07 01:05:41,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:41,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:41,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:41,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:41,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:41,500 INFO L87 Difference]: Start difference. First operand 49584 states and 81277 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:44,936 INFO L93 Difference]: Finished difference Result 108888 states and 182936 transitions. [2024-11-07 01:05:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:05:44,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:45,125 INFO L225 Difference]: With dead ends: 108888 [2024-11-07 01:05:45,125 INFO L226 Difference]: Without dead ends: 61438 [2024-11-07 01:05:45,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:05:45,213 INFO L432 NwaCegarLoop]: 4122 mSDtfsCounter, 4533 mSDsluCounter, 16337 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4546 SdHoareTripleChecker+Valid, 20459 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:45,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4546 Valid, 20459 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:05:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61438 states. [2024-11-07 01:05:47,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61438 to 49584. [2024-11-07 01:05:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49584 states, 44693 states have (on average 1.5219609334795159) internal successors, (68021), 44951 states have internal predecessors, (68021), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 1798 states have return successors, (9908), 3346 states have call predecessors, (9908), 3091 states have call successors, (9908) [2024-11-07 01:05:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49584 states to 49584 states and 81020 transitions. [2024-11-07 01:05:48,053 INFO L78 Accepts]: Start accepts. Automaton has 49584 states and 81020 transitions. Word has length 101 [2024-11-07 01:05:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:48,053 INFO L471 AbstractCegarLoop]: Abstraction has 49584 states and 81020 transitions. [2024-11-07 01:05:48,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 49584 states and 81020 transitions. [2024-11-07 01:05:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:05:48,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:48,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:48,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:05:48,081 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:48,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:48,082 INFO L85 PathProgramCache]: Analyzing trace with hash -791516297, now seen corresponding path program 1 times [2024-11-07 01:05:48,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:48,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884400612] [2024-11-07 01:05:48,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:48,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:48,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:48,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:48,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:05:48,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884400612] [2024-11-07 01:05:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884400612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:48,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:48,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:05:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880764558] [2024-11-07 01:05:48,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:48,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:05:48,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:48,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:05:48,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:05:48,188 INFO L87 Difference]: Start difference. First operand 49584 states and 81020 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:52,363 INFO L93 Difference]: Finished difference Result 137775 states and 222018 transitions. [2024-11-07 01:05:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:05:52,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:05:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:52,585 INFO L225 Difference]: With dead ends: 137775 [2024-11-07 01:05:52,586 INFO L226 Difference]: Without dead ends: 90326 [2024-11-07 01:05:52,693 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:05:52,693 INFO L432 NwaCegarLoop]: 4309 mSDtfsCounter, 4947 mSDsluCounter, 12534 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4978 SdHoareTripleChecker+Valid, 16843 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:52,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4978 Valid, 16843 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:05:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90326 states. [2024-11-07 01:05:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90326 to 73121. [2024-11-07 01:05:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73121 states, 65713 states have (on average 1.5070381811818057) internal successors, (99032), 66228 states have internal predecessors, (99032), 4706 states have call successors, (4706), 2316 states have call predecessors, (4706), 2700 states have return successors, (13711), 4832 states have call predecessors, (13711), 4706 states have call successors, (13711) [2024-11-07 01:05:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73121 states to 73121 states and 117449 transitions. [2024-11-07 01:05:55,855 INFO L78 Accepts]: Start accepts. Automaton has 73121 states and 117449 transitions. Word has length 101 [2024-11-07 01:05:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:55,855 INFO L471 AbstractCegarLoop]: Abstraction has 73121 states and 117449 transitions. [2024-11-07 01:05:55,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 73121 states and 117449 transitions. [2024-11-07 01:05:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 01:05:55,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:55,970 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:55,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:05:55,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:55,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:55,970 INFO L85 PathProgramCache]: Analyzing trace with hash 222823872, now seen corresponding path program 1 times [2024-11-07 01:05:55,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:55,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942338310] [2024-11-07 01:05:55,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:55,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:05:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:56,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:05:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:05:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:56,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:05:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:56,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 01:05:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:56,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:05:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:56,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 01:05:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 01:05:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:56,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942338310] [2024-11-07 01:05:56,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942338310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:05:56,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067781165] [2024-11-07 01:05:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:56,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:05:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:05:56,105 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:05:56,106 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:05:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:56,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:05:56,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:05:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 01:05:56,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:05:56,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067781165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:56,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:05:56,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 01:05:56,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220477406] [2024-11-07 01:05:56,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:56,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:05:56,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:56,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:05:56,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:56,322 INFO L87 Difference]: Start difference. First operand 73121 states and 117449 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)