./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i --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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i', '-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', '4ba4618d2c12b624306627073ace8aff518621333cf7d938808dd7313f83bbaa'] 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i -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 4ba4618d2c12b624306627073ace8aff518621333cf7d938808dd7313f83bbaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:37:07,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:37:07,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:37:07,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:37:07,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:37:07,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:37:07,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:37:07,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:37:07,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:37:07,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:37:07,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:37:07,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:37:07,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:37:07,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:37:07,225 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:37:07,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:37:07,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:37:07,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:37:07,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:37:07,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:37:07,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:37:07,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:37:07,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:37:07,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:37:07,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:37:07,227 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 -> 4ba4618d2c12b624306627073ace8aff518621333cf7d938808dd7313f83bbaa [2024-11-07 10:37:07,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:37:07,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:37:07,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:37:07,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:37:07,444 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:37:07,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i [2024-11-07 10:37:08,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:37:08,766 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:37:08,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i [2024-11-07 10:37:08,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/487c288ac/6e8632e3d35348eaaa37f1075fab25ee/FLAGc9ccf7c9c [2024-11-07 10:37:09,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/487c288ac/6e8632e3d35348eaaa37f1075fab25ee [2024-11-07 10:37:09,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:37:09,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:37:09,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:37:09,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:37:09,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:37:09,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@792578d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09, skipping insertion in model container [2024-11-07 10:37:09,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:37:09,266 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i[916,929] [2024-11-07 10:37:09,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:37:09,327 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:37:09,334 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i[916,929] [2024-11-07 10:37:09,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:37:09,368 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:37:09,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09 WrapperNode [2024-11-07 10:37:09,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:37:09,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:37:09,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:37:09,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:37:09,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,431 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 558 [2024-11-07 10:37:09,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:37:09,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:37:09,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:37:09,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:37:09,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,475 INFO L175 MemorySlicer]: Split 131 memory accesses to 16 slices as follows [2, 15, 6, 10, 11, 8, 8, 8, 10, 7, 6, 8, 3, 12, 7, 10]. 11 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1]. [2024-11-07 10:37:09,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:37:09,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:37:09,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:37:09,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:37:09,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (1/1) ... [2024-11-07 10:37:09,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:37:09,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:37:09,547 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 10:37:09,553 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 10:37:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:37:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:37:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:37:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:37:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:37:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:37:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 10:37:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-07 10:37:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-07 10:37:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-07 10:37:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-07 10:37:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-07 10:37:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-07 10:37:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-07 10:37:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-07 10:37:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-07 10:37:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-07 10:37:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:37:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:37:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:37:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:37:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:37:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-07 10:37:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-07 10:37:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-07 10:37:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-07 10:37:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-07 10:37:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-07 10:37:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-07 10:37:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-07 10:37:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-07 10:37:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-07 10:37:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-11-07 10:37:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:37:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:37:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:37:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:37:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:37:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-07 10:37:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-07 10:37:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-07 10:37:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-07 10:37:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-07 10:37:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-07 10:37:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-07 10:37:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-07 10:37:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-07 10:37:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-07 10:37:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-11-07 10:37:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:37:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:37:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:37:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:37:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:37:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 10:37:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-07 10:37:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-07 10:37:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-07 10:37:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-07 10:37:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-07 10:37:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-07 10:37:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-07 10:37:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-07 10:37:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-07 10:37:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-11-07 10:37:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:37:09,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:37:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:37:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:37:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:37:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:37:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:37:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 10:37:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-07 10:37:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-07 10:37:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-07 10:37:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-07 10:37:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-07 10:37:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-07 10:37:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-07 10:37:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-07 10:37:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-07 10:37:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-07 10:37:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:37:09,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:37:09,766 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:37:09,767 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:37:10,267 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-11-07 10:37:10,267 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:37:10,277 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:37:10,279 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:37:10,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:37:10 BoogieIcfgContainer [2024-11-07 10:37:10,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:37:10,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:37:10,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:37:10,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:37:10,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:37:09" (1/3) ... [2024-11-07 10:37:10,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4500c0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:37:10, skipping insertion in model container [2024-11-07 10:37:10,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:37:09" (2/3) ... [2024-11-07 10:37:10,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4500c0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:37:10, skipping insertion in model container [2024-11-07 10:37:10,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:37:10" (3/3) ... [2024-11-07 10:37:10,286 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-64.i [2024-11-07 10:37:10,296 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:37:10,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:37:10,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:37:10,347 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;@64025cee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:37:10,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:37:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:37:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 10:37:10,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:37:10,360 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:37:10,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:37:10,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:37:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1185562464, now seen corresponding path program 1 times [2024-11-07 10:37:10,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:37:10,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355485469] [2024-11-07 10:37:10,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:37:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:37:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:37:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:37:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:37:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:37:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:37:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:37:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:37:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:37:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:37:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:37:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:37:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:37:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:37:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:37:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:37:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:37:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:37:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:37:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:37:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:37:10,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:37:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355485469] [2024-11-07 10:37:10,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355485469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:37:10,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:37:10,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:37:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254501850] [2024-11-07 10:37:10,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:37:10,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:37:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:37:10,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:37:10,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:37:10,715 INFO L87 Difference]: Start difference. First operand has 129 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 107 states have internal predecessors, (152), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:37:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:37:10,742 INFO L93 Difference]: Finished difference Result 251 states and 398 transitions. [2024-11-07 10:37:10,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:37:10,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2024-11-07 10:37:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:37:10,748 INFO L225 Difference]: With dead ends: 251 [2024-11-07 10:37:10,748 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 10:37:10,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:37:10,754 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:37:10,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:37:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 10:37:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-07 10:37:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 103 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:37:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions. [2024-11-07 10:37:10,795 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 159 [2024-11-07 10:37:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:37:10,796 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions. [2024-11-07 10:37:10,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:37:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions. [2024-11-07 10:37:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 10:37:10,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:37:10,803 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:37:10,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:37:10,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:37:10,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:37:10,803 INFO L85 PathProgramCache]: Analyzing trace with hash -451419712, now seen corresponding path program 1 times [2024-11-07 10:37:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:37:10,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906717420] [2024-11-07 10:37:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:37:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:37:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:37:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:37:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:37:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:37:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:37:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:37:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:37:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:37:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:37:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:37:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:37:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:37:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:37:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:37:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:37:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:37:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:37:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:37:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:37:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:37:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:37:11,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906717420] [2024-11-07 10:37:11,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906717420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:37:11,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:37:11,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:37:11,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429552550] [2024-11-07 10:37:11,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:37:11,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:37:11,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:37:11,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:37:11,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:37:11,166 INFO L87 Difference]: Start difference. First operand 125 states and 185 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:37:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:37:11,211 INFO L93 Difference]: Finished difference Result 249 states and 370 transitions. [2024-11-07 10:37:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:37:11,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2024-11-07 10:37:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:37:11,213 INFO L225 Difference]: With dead ends: 249 [2024-11-07 10:37:11,213 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 10:37:11,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:37:11,214 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:37:11,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:37:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 10:37:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-07 10:37:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:37:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 187 transitions. [2024-11-07 10:37:11,228 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 187 transitions. Word has length 159 [2024-11-07 10:37:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:37:11,229 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 187 transitions. [2024-11-07 10:37:11,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:37:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 187 transitions. [2024-11-07 10:37:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 10:37:11,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:37:11,230 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:37:11,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:37:11,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:37:11,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:37:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1581974334, now seen corresponding path program 1 times [2024-11-07 10:37:11,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:37:11,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455563902] [2024-11-07 10:37:11,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:37:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:37:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:37:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:37:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:37:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:37:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:37:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:37:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:37:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:37:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:37:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:37:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:37:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:37:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:37:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:37:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:37:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:37:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:37:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:37:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:37:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:37:11,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:37:11,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455563902] [2024-11-07 10:37:11,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455563902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:37:11,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:37:11,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:37:11,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928659488] [2024-11-07 10:37:11,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:37:11,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:37:11,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:37:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:37:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:37:11,522 INFO L87 Difference]: Start difference. First operand 127 states and 187 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:37:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:37:11,559 INFO L93 Difference]: Finished difference Result 253 states and 374 transitions. [2024-11-07 10:37:11,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:37:11,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2024-11-07 10:37:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:37:11,561 INFO L225 Difference]: With dead ends: 253 [2024-11-07 10:37:11,561 INFO L226 Difference]: Without dead ends: 129 [2024-11-07 10:37:11,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:37:11,562 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:37:11,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:37:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-07 10:37:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-07 10:37:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 107 states have internal predecessors, (149), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:37:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2024-11-07 10:37:11,572 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 159 [2024-11-07 10:37:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:37:11,573 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2024-11-07 10:37:11,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:37:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2024-11-07 10:37:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 10:37:11,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:37:11,578 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:37:11,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:37:11,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:37:11,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:37:11,579 INFO L85 PathProgramCache]: Analyzing trace with hash -297805104, now seen corresponding path program 1 times [2024-11-07 10:37:11,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:37:11,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381107503] [2024-11-07 10:37:11,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:37:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:37:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:37:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:37:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:37:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:37:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:37:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:37:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:37:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:37:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:37:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:37:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:37:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:37:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:37:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:37:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:37:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:37:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:37:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:37:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:37:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:37:11,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:37:11,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381107503] [2024-11-07 10:37:11,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381107503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:37:11,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:37:11,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:37:11,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957220150] [2024-11-07 10:37:11,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:37:11,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:37:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:37:11,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:37:11,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:37:11,836 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:37:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:37:11,873 INFO L93 Difference]: Finished difference Result 258 states and 379 transitions. [2024-11-07 10:37:11,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:37:11,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 161 [2024-11-07 10:37:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:37:11,876 INFO L225 Difference]: With dead ends: 258 [2024-11-07 10:37:11,876 INFO L226 Difference]: Without dead ends: 132 [2024-11-07 10:37:11,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:37:11,877 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:37:11,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 711 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:37:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-07 10:37:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-07 10:37:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.3818181818181818) internal successors, (152), 110 states have internal predecessors, (152), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:37:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 192 transitions. [2024-11-07 10:37:11,887 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 192 transitions. Word has length 161 [2024-11-07 10:37:11,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:37:11,888 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 192 transitions. [2024-11-07 10:37:11,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:37:11,889 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 192 transitions. [2024-11-07 10:37:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 10:37:11,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:37:11,891 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:37:11,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:37:11,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:37:11,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:37:11,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1724456741, now seen corresponding path program 1 times [2024-11-07 10:37:11,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:37:11,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168665465] [2024-11-07 10:37:11,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:11,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:37:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:37:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:37:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:37:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:37:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:37:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:37:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:37:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:37:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:37:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:37:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:37:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:37:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:37:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:37:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:37:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:37:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:37:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:37:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:37:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:37:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:37:12,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:37:12,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168665465] [2024-11-07 10:37:12,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168665465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:37:12,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:37:12,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:37:12,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953251130] [2024-11-07 10:37:12,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:37:12,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:37:12,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:37:12,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:37:12,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:37:12,621 INFO L87 Difference]: Start difference. First operand 132 states and 192 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:37:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:37:12,981 INFO L93 Difference]: Finished difference Result 491 states and 713 transitions. [2024-11-07 10:37:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:37:12,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-07 10:37:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:37:12,984 INFO L225 Difference]: With dead ends: 491 [2024-11-07 10:37:12,984 INFO L226 Difference]: Without dead ends: 362 [2024-11-07 10:37:12,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:37:12,985 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 386 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:37:12,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 881 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:37:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-07 10:37:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 149. [2024-11-07 10:37:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 127 states have internal predecessors, (178), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:37:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 218 transitions. [2024-11-07 10:37:13,001 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 218 transitions. Word has length 162 [2024-11-07 10:37:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:37:13,001 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 218 transitions. [2024-11-07 10:37:13,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:37:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 218 transitions. [2024-11-07 10:37:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 10:37:13,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:37:13,003 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:37:13,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:37:13,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:37:13,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:37:13,003 INFO L85 PathProgramCache]: Analyzing trace with hash -844039851, now seen corresponding path program 1 times [2024-11-07 10:37:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:37:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686399644] [2024-11-07 10:37:13,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:37:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:37:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:37:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:37:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:37:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:37:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:37:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:37:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:37:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:37:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:37:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:37:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:37:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:37:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:37:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:37:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:37:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:37:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:37:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:37:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:37:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:37:13,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:37:13,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686399644] [2024-11-07 10:37:13,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686399644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:37:13,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394160310] [2024-11-07 10:37:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:13,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:37:13,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:37:13,798 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 10:37:13,799 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 10:37:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:14,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 10:37:14,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:37:14,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:37:14,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-07 10:37:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 336 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-07 10:37:14,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:37:15,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-07 10:37:15,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-07 10:37:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:37:15,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394160310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:37:15,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:37:15,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 31 [2024-11-07 10:37:15,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137608714] [2024-11-07 10:37:15,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:37:15,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 10:37:15,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:37:15,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 10:37:15,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2024-11-07 10:37:15,483 INFO L87 Difference]: Start difference. First operand 149 states and 218 transitions. Second operand has 31 states, 28 states have (on average 5.357142857142857) internal successors, (150), 29 states have internal predecessors, (150), 7 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (60), 6 states have call predecessors, (60), 7 states have call successors, (60) [2024-11-07 10:37:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:37:17,895 INFO L93 Difference]: Finished difference Result 592 states and 845 transitions. [2024-11-07 10:37:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-07 10:37:17,896 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 5.357142857142857) internal successors, (150), 29 states have internal predecessors, (150), 7 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (60), 6 states have call predecessors, (60), 7 states have call successors, (60) Word has length 163 [2024-11-07 10:37:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:37:17,898 INFO L225 Difference]: With dead ends: 592 [2024-11-07 10:37:17,898 INFO L226 Difference]: Without dead ends: 446 [2024-11-07 10:37:17,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=740, Invalid=4810, Unknown=0, NotChecked=0, Total=5550 [2024-11-07 10:37:17,900 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 2457 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2477 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:37:17,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2477 Valid, 3056 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:37:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-07 10:37:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 326. [2024-11-07 10:37:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 266 states have (on average 1.3458646616541354) internal successors, (358), 267 states have internal predecessors, (358), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-07 10:37:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 464 transitions. [2024-11-07 10:37:17,920 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 464 transitions. Word has length 163 [2024-11-07 10:37:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:37:17,920 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 464 transitions. [2024-11-07 10:37:17,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 5.357142857142857) internal successors, (150), 29 states have internal predecessors, (150), 7 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (60), 6 states have call predecessors, (60), 7 states have call successors, (60) [2024-11-07 10:37:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 464 transitions. [2024-11-07 10:37:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 10:37:17,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:37:17,921 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:37:17,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:37:18,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:37:18,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:37:18,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:37:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash 588162187, now seen corresponding path program 1 times [2024-11-07 10:37:18,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:37:18,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066920230] [2024-11-07 10:37:18,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:18,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:37:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:37:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946385247] [2024-11-07 10:37:18,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:18,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:37:18,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:37:18,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:37:18,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 10:37:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:18,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 10:37:18,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:37:18,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:37:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 13 proven. 375 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-07 10:37:19,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:37:19,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2024-11-07 10:37:19,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:37:19,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066920230] [2024-11-07 10:37:19,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:37:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946385247] [2024-11-07 10:37:19,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946385247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:37:19,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:37:19,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-07 10:37:19,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832083780] [2024-11-07 10:37:19,711 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 10:37:19,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:37:19,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:37:19,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:37:19,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:37:19,713 INFO L87 Difference]: Start difference. First operand 326 states and 464 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:37:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:37:20,129 INFO L93 Difference]: Finished difference Result 682 states and 973 transitions. [2024-11-07 10:37:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 10:37:20,130 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 164 [2024-11-07 10:37:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:37:20,133 INFO L225 Difference]: With dead ends: 682 [2024-11-07 10:37:20,133 INFO L226 Difference]: Without dead ends: 437 [2024-11-07 10:37:20,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2024-11-07 10:37:20,135 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 429 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:37:20,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 972 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:37:20,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-07 10:37:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 331. [2024-11-07 10:37:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 270 states have (on average 1.3407407407407408) internal successors, (362), 271 states have internal predecessors, (362), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-07 10:37:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 468 transitions. [2024-11-07 10:37:20,164 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 468 transitions. Word has length 164 [2024-11-07 10:37:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:37:20,164 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 468 transitions. [2024-11-07 10:37:20,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:37:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 468 transitions. [2024-11-07 10:37:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 10:37:20,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:37:20,166 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:37:20,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 10:37:20,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:37:20,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:37:20,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:37:20,368 INFO L85 PathProgramCache]: Analyzing trace with hash 728710797, now seen corresponding path program 1 times [2024-11-07 10:37:20,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:37:20,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375639566] [2024-11-07 10:37:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:20,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:37:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat