./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-51.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-a_file-51.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', '4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c'] 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-a_file-51.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 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:13:49,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:13:49,807 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:13:49,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:13:49,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:13:49,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:13:49,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:13:49,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:13:49,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:13:49,846 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:13:49,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:13:49,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:13:49,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:13:49,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:13:49,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:13:49,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:13:49,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:13:49,849 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:13:49,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:13:49,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:13:49,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:13:49,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:13:49,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:13:49,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:13:49,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:13:49,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:13:49,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:13:49,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:13:49,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:13:49,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:13:49,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:13:49,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:13:49,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:13:49,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:13:49,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:13:49,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:13:49,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:13:49,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:13:49,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:13:49,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:13:49,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:13:49,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:13:49,852 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 -> 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c [2024-11-07 10:13:50,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:13:50,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:13:50,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:13:50,128 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:13:50,129 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:13:50,131 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-a_file-51.i [2024-11-07 10:13:51,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:13:51,672 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:13:51,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-51.i [2024-11-07 10:13:51,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dce509d5b/fd16dd21c8eb486695a595f73ce0ca91/FLAGeb1c450c2 [2024-11-07 10:13:51,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dce509d5b/fd16dd21c8eb486695a595f73ce0ca91 [2024-11-07 10:13:51,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:13:51,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:13:51,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:13:51,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:13:51,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:13:51,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:51" (1/1) ... [2024-11-07 10:13:51,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf1ce53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:51, skipping insertion in model container [2024-11-07 10:13:51,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:51" (1/1) ... [2024-11-07 10:13:51,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:13:51,874 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-a_file-51.i[916,929] [2024-11-07 10:13:51,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:13:51,969 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:13:51,983 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-a_file-51.i[916,929] [2024-11-07 10:13:52,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:13:52,057 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:13:52,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52 WrapperNode [2024-11-07 10:13:52,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:13:52,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:13:52,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:13:52,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:13:52,064 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:13:52" (1/1) ... [2024-11-07 10:13:52,080 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:13:52" (1/1) ... [2024-11-07 10:13:52,120 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 554 [2024-11-07 10:13:52,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:13:52,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:13:52,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:13:52,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:13:52,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52" (1/1) ... [2024-11-07 10:13:52,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52" (1/1) ... [2024-11-07 10:13:52,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52" (1/1) ... [2024-11-07 10:13:52,161 INFO L175 MemorySlicer]: Split 145 memory accesses to 5 slices as follows [2, 8, 49, 7, 79]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 1, 7]. The 18 writes are split as follows [0, 1, 7, 1, 9]. [2024-11-07 10:13:52,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52" (1/1) ... [2024-11-07 10:13:52,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52" (1/1) ... [2024-11-07 10:13:52,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52" (1/1) ... [2024-11-07 10:13:52,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52" (1/1) ... [2024-11-07 10:13:52,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52" (1/1) ... [2024-11-07 10:13:52,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52" (1/1) ... [2024-11-07 10:13:52,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:13:52,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:13:52,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:13:52,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:13:52,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52" (1/1) ... [2024-11-07 10:13:52,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:13:52,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:13:52,252 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:13:52,256 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:13:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:13:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:13:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:13:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:13:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:13:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:13:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:13:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:13:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:13:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:13:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:13:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:13:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:13:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:13:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:13:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:13:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:13:52,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:13:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:13:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:13:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:13:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:13:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:13:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:13:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:13:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:13:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:13:52,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:13:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:13:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:13:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:13:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:13:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:13:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:13:52,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:13:52,464 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:13:52,466 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:13:53,101 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-07 10:13:53,101 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:13:53,119 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:13:53,121 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:13:53,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:53 BoogieIcfgContainer [2024-11-07 10:13:53,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:13:53,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:13:53,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:13:53,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:13:53,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:13:51" (1/3) ... [2024-11-07 10:13:53,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf15635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:53, skipping insertion in model container [2024-11-07 10:13:53,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:52" (2/3) ... [2024-11-07 10:13:53,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf15635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:53, skipping insertion in model container [2024-11-07 10:13:53,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:53" (3/3) ... [2024-11-07 10:13:53,131 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-51.i [2024-11-07 10:13:53,146 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:13:53,147 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:13:53,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:13:53,212 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;@4e1ad3f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:13:53,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:13:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:13:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:13:53,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:53,234 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:53,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:53,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1995181470, now seen corresponding path program 1 times [2024-11-07 10:13:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:53,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596546989] [2024-11-07 10:13:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:13:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:13:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:13:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:13:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:13:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:13:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:13:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:13:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:13:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:13:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:13:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:13:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:13:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:13:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:13:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:13:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:13:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596546989] [2024-11-07 10:13:53,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596546989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:53,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:53,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:13:53,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134507098] [2024-11-07 10:13:53,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:53,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:13:53,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:53,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:13:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:13:53,646 INFO L87 Difference]: Start difference. First operand has 124 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:13:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:53,685 INFO L93 Difference]: Finished difference Result 241 states and 379 transitions. [2024-11-07 10:13:53,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:13:53,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-11-07 10:13:53,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:53,695 INFO L225 Difference]: With dead ends: 241 [2024-11-07 10:13:53,695 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 10:13:53,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:13:53,702 INFO L432 NwaCegarLoop]: 176 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, 176 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:13:53,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 10:13:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 10:13:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:13:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-07 10:13:53,785 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2024-11-07 10:13:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:53,787 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-07 10:13:53,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:13:53,787 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-07 10:13:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:13:53,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:53,793 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:53,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:13:53,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:53,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash -517073916, now seen corresponding path program 1 times [2024-11-07 10:13:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:53,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497594069] [2024-11-07 10:13:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:53,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:13:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:13:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:13:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:13:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:13:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:13:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:13:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:13:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:13:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:13:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:13:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:13:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:13:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:13:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:13:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:13:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:13:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:54,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497594069] [2024-11-07 10:13:54,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497594069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:54,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:54,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:13:54,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722176262] [2024-11-07 10:13:54,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:54,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:13:54,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:54,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:13:54,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:13:54,242 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:13:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:54,302 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-11-07 10:13:54,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:13:54,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-11-07 10:13:54,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:54,307 INFO L225 Difference]: With dead ends: 239 [2024-11-07 10:13:54,307 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 10:13:54,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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:13:54,310 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 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:13:54,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 10:13:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-07 10:13:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:13:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-07 10:13:54,330 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 149 [2024-11-07 10:13:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:54,331 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-07 10:13:54,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:13:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-07 10:13:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:13:54,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:54,337 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:54,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:13:54,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:54,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:54,343 INFO L85 PathProgramCache]: Analyzing trace with hash -805893306, now seen corresponding path program 1 times [2024-11-07 10:13:54,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:54,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118984358] [2024-11-07 10:13:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:54,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:13:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:13:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:13:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:13:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:13:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:13:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:13:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:13:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:13:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:13:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:13:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:13:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:13:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:13:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:13:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:13:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:13:54,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118984358] [2024-11-07 10:13:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118984358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:54,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:54,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:13:54,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003958391] [2024-11-07 10:13:54,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:54,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:13:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:13:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:13:54,859 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:13:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:54,885 INFO L93 Difference]: Finished difference Result 241 states and 353 transitions. [2024-11-07 10:13:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:13:54,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-07 10:13:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:54,889 INFO L225 Difference]: With dead ends: 241 [2024-11-07 10:13:54,890 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 10:13:54,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:13:54,892 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:54,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 10:13:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-07 10:13:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:13:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 177 transitions. [2024-11-07 10:13:54,909 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 177 transitions. Word has length 149 [2024-11-07 10:13:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:54,910 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 177 transitions. [2024-11-07 10:13:54,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:13:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 177 transitions. [2024-11-07 10:13:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:13:54,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:54,914 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:54,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:13:54,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:54,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:54,915 INFO L85 PathProgramCache]: Analyzing trace with hash 489803607, now seen corresponding path program 1 times [2024-11-07 10:13:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:54,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786450970] [2024-11-07 10:13:54,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:13:55,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:13:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:13:55,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:13:55,245 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:13:55,246 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:13:55,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:13:55,250 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 10:13:55,358 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:13:55,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:13:55 BoogieIcfgContainer [2024-11-07 10:13:55,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:13:55,363 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:13:55,363 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:13:55,364 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:13:55,364 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:53" (3/4) ... [2024-11-07 10:13:55,367 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:13:55,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:13:55,369 INFO L158 Benchmark]: Toolchain (without parser) took 3659.84ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.4MB in the beginning and 86.3MB in the end (delta: 5.2MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-07 10:13:55,369 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:13:55,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.07ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 76.4MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:13:55,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.91ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 72.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:13:55,371 INFO L158 Benchmark]: Boogie Preprocessor took 90.49ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 68.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:13:55,371 INFO L158 Benchmark]: RCFGBuilder took 909.55ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 78.7MB in the end (delta: -10.3MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2024-11-07 10:13:55,372 INFO L158 Benchmark]: TraceAbstraction took 2238.34ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 78.2MB in the beginning and 86.3MB in the end (delta: -8.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-11-07 10:13:55,372 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 86.3MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:13:55,374 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.07ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 76.4MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.91ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 72.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 90.49ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 68.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 909.55ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 78.7MB in the end (delta: -10.3MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2238.34ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 78.2MB in the beginning and 86.3MB in the end (delta: -8.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 86.3MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L25-L27] double double_Array_0[5] = { 127.5, 10.6, 999999999.4, 100.01, 10.8 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -16 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -16 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[7] = { 2565572511, 500, 1, 2467894503, 2745650083, 8, 2277019112 }; [L34] unsigned long int last_1_unsigned_long_int_Array_0_5_ = 8; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] EXPR unsigned_long_int_Array_0[5] [L97] last_1_unsigned_long_int_Array_0_5_ = unsigned_long_int_Array_0[5] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] double_Array_0[0] = __VERIFIER_nondet_double() [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] CALL assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] RET assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] double_Array_0[1] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] double_Array_0[2] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[2] [L73] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F [L73] EXPR double_Array_0[2] [L73] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] EXPR (double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] EXPR (double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] CALL assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] RET assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] double_Array_0[3] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[3] [L75] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F [L75] EXPR double_Array_0[3] [L75] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] RET assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L80] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L83] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L86] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L89] unsigned_long_int_Array_0[4] = __VERIFIER_nondet_ulong() [L90] EXPR unsigned_long_int_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[4] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[4] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L91] EXPR unsigned_long_int_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[4] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[4] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L92] unsigned_long_int_Array_0[6] = __VERIFIER_nondet_ulong() [L93] EXPR unsigned_long_int_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[6] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[6] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR unsigned_long_int_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[6] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[6] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L38] unsigned long int stepLocal_1 = - last_1_unsigned_long_int_Array_0_5_; [L39] EXPR unsigned_long_int_Array_0[3] [L39] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L39] EXPR ((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]) [L39] EXPR unsigned_long_int_Array_0[3] [L39] EXPR ((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, stepLocal_1=-8, unsigned_long_int_Array_0={7:0}] [L39] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L39] COND FALSE !((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != stepLocal_1) [L42] EXPR unsigned_long_int_Array_0[6] [L42] unsigned_long_int_Array_0[2] = unsigned_long_int_Array_0[6] [L44] EXPR unsigned_long_int_Array_0[2] [L44] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L44] COND TRUE unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2] [L45] EXPR BOOL_unsigned_char_Array_0[0] [L45] BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L45] BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) [L53] EXPR unsigned_long_int_Array_0[2] [L53] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[2]; [L54] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L61] EXPR double_Array_0[1] [L61] double_Array_0[4] = double_Array_0[1] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1])) [L100] EXPR double_Array_0[4] [L100] EXPR double_Array_0[1] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR (BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6])))) && ((unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) ? ((unsigned_long_int_Array_0[2] < unsigned_long_int_Array_0[3]) ? (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[6])) : 1) : 1) : (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100] EXPR ((BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6])))) && ((unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) ? ((unsigned_long_int_Array_0[2] < unsigned_long_int_Array_0[3]) ? (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[6])) : 1) : 1) : (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L100-L101] return ((BOOL_unsigned_char_Array_0[0] ? ((unsigned_long_int_Array_0[2] >= (unsigned_long_int_Array_0[2] / signed_short_int_Array_0[0])) ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) < 0 ) ? -(double_Array_0[3]) : (double_Array_0[3]))))) : (double_Array_0[4] == ((double) (double_Array_0[2] + ((((double_Array_0[1]) > ((double_Array_0[0] + 63.25))) ? (double_Array_0[1]) : ((double_Array_0[0] + 63.25)))))))) : (double_Array_0[4] == ((double) double_Array_0[1]))) && (((((((unsigned_long_int_Array_0[3]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[3]) : (unsigned_long_int_Array_0[0]))) - unsigned_long_int_Array_0[1]) != (- last_1_unsigned_long_int_Array_0_5_)) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) (((((unsigned_long_int_Array_0[6]) < (unsigned_long_int_Array_0[4])) ? (unsigned_long_int_Array_0[6]) : (unsigned_long_int_Array_0[4]))) - unsigned_long_int_Array_0[1]))) : (unsigned_long_int_Array_0[2] == ((unsigned long int) unsigned_long_int_Array_0[6])))) && ((unsigned_long_int_Array_0[2] <= unsigned_long_int_Array_0[2]) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_long_int_Array_0[2] == ((((unsigned_long_int_Array_0[4]) > (unsigned_long_int_Array_0[0])) ? (unsigned_long_int_Array_0[4]) : (unsigned_long_int_Array_0[0]))))) ? ((unsigned_long_int_Array_0[2] < unsigned_long_int_Array_0[3]) ? (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[6])) : 1) : 1) : (unsigned_long_int_Array_0[5] == ((unsigned long int) unsigned_long_int_Array_0[4]))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_long_int_Array_0_5_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 1032 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 508 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 524 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 598 NumberOfCodeBlocks, 598 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2052/2052 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:13:55,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-a_file-51.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:13:57,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:13:57,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:13:57,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:13:57,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:13:57,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:13:57,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:13:57,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:13:57,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:13:57,764 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:13:57,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:13:57,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:13:57,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:13:57,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:13:57,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:13:57,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:13:57,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:13:57,766 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:13:57,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:13:57,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:13:57,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:13:57,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:13:57,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:13:57,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:13:57,767 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:13:57,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:13:57,767 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:13:57,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:13:57,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:13:57,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:13:57,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:13:57,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:13:57,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:13:57,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:13:57,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:13:57,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:13:57,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:13:57,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:13:57,770 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:13:57,770 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:13:57,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:13:57,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:13:57,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:13:57,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:13:57,770 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 -> 4c325d93e59be9711665baa02e130ec0fdff30298f1a41b16a3d5d6f34a29b0c [2024-11-07 10:13:58,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:13:58,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:13:58,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:13:58,058 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:13:58,058 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:13:58,061 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-a_file-51.i [2024-11-07 10:13:59,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:13:59,428 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-07 10:13:59,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:13:59,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-51.i [2024-11-07 10:13:59,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a397a001c/79198892afdd4a84a97ecf40e734abbc/FLAG246ae00e4 [2024-11-07 10:13:59,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a397a001c/79198892afdd4a84a97ecf40e734abbc [2024-11-07 10:13:59,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:13:59,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:13:59,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:13:59,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:13:59,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:13:59,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebea7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:59, skipping insertion in model container [2024-11-07 10:13:59,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:59" (1/1) ... [2024-11-07 10:13:59,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:13:59,877 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-a_file-51.i[916,929] [2024-11-07 10:13:59,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:13:59,987 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:13:59,999 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-a_file-51.i[916,929] [2024-11-07 10:14:00,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:14:00,075 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:14:00,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00 WrapperNode [2024-11-07 10:14:00,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:14:00,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:14:00,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:14:00,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:14:00,082 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:14:00" (1/1) ... [2024-11-07 10:14:00,095 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:14:00" (1/1) ... [2024-11-07 10:14:00,137 INFO L138 Inliner]: procedures = 36, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 553 [2024-11-07 10:14:00,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:14:00,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:14:00,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:14:00,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:14:00,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00" (1/1) ... [2024-11-07 10:14:00,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00" (1/1) ... [2024-11-07 10:14:00,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00" (1/1) ... [2024-11-07 10:14:00,180 INFO L175 MemorySlicer]: Split 145 memory accesses to 5 slices as follows [2, 8, 49, 7, 79]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 1, 7]. The 18 writes are split as follows [0, 1, 7, 1, 9]. [2024-11-07 10:14:00,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00" (1/1) ... [2024-11-07 10:14:00,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00" (1/1) ... [2024-11-07 10:14:00,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00" (1/1) ... [2024-11-07 10:14:00,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00" (1/1) ... [2024-11-07 10:14:00,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00" (1/1) ... [2024-11-07 10:14:00,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00" (1/1) ... [2024-11-07 10:14:00,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:14:00,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:14:00,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:14:00,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:14:00,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00" (1/1) ... [2024-11-07 10:14:00,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:14:00,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:14:00,261 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:14:00,265 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:14:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:14:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:14:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:14:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-07 10:14:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-07 10:14:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-07 10:14:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:14:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:14:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-07 10:14:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-07 10:14:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-07 10:14:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:14:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:14:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:14:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:14:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:14:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:14:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:14:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 10:14:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 10:14:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-07 10:14:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:14:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:14:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:14:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:14:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:14:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 10:14:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 10:14:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 10:14:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 10:14:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-07 10:14:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-07 10:14:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-07 10:14:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:14:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:14:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:14:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 10:14:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-07 10:14:00,453 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:14:00,455 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:14:02,416 INFO L? ?]: Removed 151 outVars from TransFormulas that were not future-live. [2024-11-07 10:14:02,417 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:14:02,432 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:14:02,433 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:14:02,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:02 BoogieIcfgContainer [2024-11-07 10:14:02,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:14:02,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:14:02,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:14:02,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:14:02,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:13:59" (1/3) ... [2024-11-07 10:14:02,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ae34b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:14:02, skipping insertion in model container [2024-11-07 10:14:02,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:00" (2/3) ... [2024-11-07 10:14:02,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ae34b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:14:02, skipping insertion in model container [2024-11-07 10:14:02,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:02" (3/3) ... [2024-11-07 10:14:02,444 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-51.i [2024-11-07 10:14:02,458 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:14:02,459 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:14:02,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:14:02,541 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;@4283b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:14:02,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:14:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:14:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:14:02,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:02,567 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:02,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:02,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1995181470, now seen corresponding path program 1 times [2024-11-07 10:14:02,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:02,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906209183] [2024-11-07 10:14:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:02,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:02,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:02,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:02,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 10:14:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:03,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:14:03,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-07 10:14:03,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:03,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906209183] [2024-11-07 10:14:03,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906209183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:03,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:03,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:14:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289758329] [2024-11-07 10:14:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:03,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:14:03,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:03,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:14:03,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:14:03,130 INFO L87 Difference]: Start difference. First operand has 124 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:14:03,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:03,170 INFO L93 Difference]: Finished difference Result 241 states and 379 transitions. [2024-11-07 10:14:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:14:03,173 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-11-07 10:14:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:03,181 INFO L225 Difference]: With dead ends: 241 [2024-11-07 10:14:03,182 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 10:14:03,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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:14:03,190 INFO L432 NwaCegarLoop]: 176 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, 176 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:14:03,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:14:03,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 10:14:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 10:14:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:14:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-07 10:14:03,241 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2024-11-07 10:14:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:03,242 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-07 10:14:03,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:14:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-07 10:14:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:14:03,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:03,249 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:03,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 10:14:03,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:03,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:03,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash -517073916, now seen corresponding path program 1 times [2024-11-07 10:14:03,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:03,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101156434] [2024-11-07 10:14:03,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:03,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:03,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:03,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:03,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 10:14:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:03,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:14:03,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-07 10:14:03,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:03,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:03,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101156434] [2024-11-07 10:14:03,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101156434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:03,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:03,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:14:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548315259] [2024-11-07 10:14:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:03,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:14:03,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:03,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:14:03,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:14:03,912 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:14:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:04,050 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-11-07 10:14:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:14:04,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-11-07 10:14:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:04,055 INFO L225 Difference]: With dead ends: 239 [2024-11-07 10:14:04,055 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 10:14:04,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 146 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:14:04,057 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:04,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:14:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 10:14:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-07 10:14:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:14:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-07 10:14:04,075 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 149 [2024-11-07 10:14:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:04,076 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-07 10:14:04,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:14:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-07 10:14:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:14:04,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:04,078 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:04,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:14:04,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:04,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:04,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash -805893306, now seen corresponding path program 1 times [2024-11-07 10:14:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:04,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112005249] [2024-11-07 10:14:04,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:04,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:04,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:04,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:04,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 10:14:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:04,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:14:04,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:04,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 22 [2024-11-07 10:14:04,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:04,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 13 [2024-11-07 10:14:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 120 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 10:14:04,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:14:05,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112005249] [2024-11-07 10:14:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112005249] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:05,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:14:05,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-07 10:14:05,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477268088] [2024-11-07 10:14:05,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:05,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:14:05,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:05,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:14:05,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:05,178 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:14:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:05,211 INFO L93 Difference]: Finished difference Result 241 states and 353 transitions. [2024-11-07 10:14:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:14:05,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-07 10:14:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:05,214 INFO L225 Difference]: With dead ends: 241 [2024-11-07 10:14:05,214 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 10:14:05,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:05,218 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:05,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:14:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 10:14:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-07 10:14:05,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:14:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 177 transitions. [2024-11-07 10:14:05,229 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 177 transitions. Word has length 149 [2024-11-07 10:14:05,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:05,230 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 177 transitions. [2024-11-07 10:14:05,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:14:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 177 transitions. [2024-11-07 10:14:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:14:05,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:05,232 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:05,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 10:14:05,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:05,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:05,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:05,434 INFO L85 PathProgramCache]: Analyzing trace with hash 489803607, now seen corresponding path program 1 times [2024-11-07 10:14:05,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:05,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386491176] [2024-11-07 10:14:05,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:05,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:05,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:05,437 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:05,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 10:14:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:06,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 10:14:06,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:06,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2024-11-07 10:14:06,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:06,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 69 [2024-11-07 10:14:09,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:09,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 82 [2024-11-07 10:14:18,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:18,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 126 [2024-11-07 10:14:19,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:19,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 418 treesize of output 142 [2024-11-07 10:14:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 116 proven. 192 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-07 10:14:19,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:19,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386491176] [2024-11-07 10:14:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386491176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [716999146] [2024-11-07 10:14:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:19,644 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:14:19,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:14:19,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:14:19,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 10:14:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:21,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 10:14:21,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:21,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-07 10:14:28,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:28,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 71 [2024-11-07 10:14:34,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:34,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 74 [2024-11-07 10:14:37,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:37,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 111 [2024-11-07 10:14:44,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:44,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 307 treesize of output 155 [2024-11-07 10:14:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 60 proven. 192 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-07 10:14:44,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:44,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [716999146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:44,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:14:44,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-07 10:14:44,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851414289] [2024-11-07 10:14:44,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:14:44,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 10:14:44,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:44,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 10:14:44,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=376, Unknown=9, NotChecked=0, Total=462 [2024-11-07 10:14:44,513 INFO L87 Difference]: Start difference. First operand 122 states and 177 transitions. Second operand has 19 states, 19 states have (on average 6.578947368421052) internal successors, (125), 18 states have internal predecessors, (125), 7 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2024-11-07 10:14:48,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:14:52,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:14:55,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:15:10,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:15:14,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:15:17,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]