./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.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_codestructure_steplocals_file-21.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', '28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3'] 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_codestructure_steplocals_file-21.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 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:18:14,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:18:14,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:18:14,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:18:14,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:18:14,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:18:14,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:18:14,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:18:14,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:18:14,820 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:18:14,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:18:14,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:18:14,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:18:14,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:18:14,822 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:18:14,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:18:14,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:18:14,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:18:14,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:18:14,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:18:14,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:18:14,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:18:14,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:18:14,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:18:14,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:18:14,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:18:14,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:18:14,824 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:18:14,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:18:14,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:18:14,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:18:14,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:18:14,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:18:14,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:18:14,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:18:14,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:18:14,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:18:14,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:18:14,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:18:14,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:18:14,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:18:14,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:18:14,825 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 -> 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 [2024-11-07 04:18:15,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:18:15,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:18:15,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:18:15,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:18:15,131 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:18:15,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-11-07 04:18:16,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:18:16,734 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:18:16,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-11-07 04:18:16,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de94986da/351d166bef5244c2b6abc0b643e544c8/FLAG060d688ca [2024-11-07 04:18:16,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de94986da/351d166bef5244c2b6abc0b643e544c8 [2024-11-07 04:18:16,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:18:16,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:18:16,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:18:16,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:18:16,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:18:16,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:18:16" (1/1) ... [2024-11-07 04:18:16,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b87e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:16, skipping insertion in model container [2024-11-07 04:18:16,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:18:16" (1/1) ... [2024-11-07 04:18:16,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:18:16,944 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_codestructure_steplocals_file-21.i[917,930] [2024-11-07 04:18:17,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:18:17,027 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:18:17,038 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_codestructure_steplocals_file-21.i[917,930] [2024-11-07 04:18:17,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:18:17,112 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:18:17,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17 WrapperNode [2024-11-07 04:18:17,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:18:17,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:18:17,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:18:17,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:18:17,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,188 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-07 04:18:17,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:18:17,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:18:17,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:18:17,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:18:17,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,244 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:18:17,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:18:17,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:18:17,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:18:17,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:18:17,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (1/1) ... [2024-11-07 04:18:17,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:18:17,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:18:17,318 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 04:18:17,321 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 04:18:17,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:18:17,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:18:17,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:18:17,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:18:17,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:18:17,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:18:17,437 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:18:17,439 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:18:17,860 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-07 04:18:17,860 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:18:17,872 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:18:17,872 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:18:17,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:18:17 BoogieIcfgContainer [2024-11-07 04:18:17,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:18:17,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:18:17,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:18:17,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:18:17,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:18:16" (1/3) ... [2024-11-07 04:18:17,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492dd55c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:18:17, skipping insertion in model container [2024-11-07 04:18:17,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:17" (2/3) ... [2024-11-07 04:18:17,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492dd55c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:18:17, skipping insertion in model container [2024-11-07 04:18:17,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:18:17" (3/3) ... [2024-11-07 04:18:17,883 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-21.i [2024-11-07 04:18:17,896 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:18:17,897 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:18:17,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:18:17,962 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;@b7c586e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:18:17,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:18:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 54 states have internal predecessors, (69), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 04:18:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-07 04:18:17,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:18:17,986 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:17,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:18:17,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:18:17,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1877296607, now seen corresponding path program 1 times [2024-11-07 04:18:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:18:17,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151710669] [2024-11-07 04:18:17,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:18:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:18:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:18:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:18:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:18:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:18:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:18:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:18:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:18:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:18:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:18:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:18:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:18:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:18:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:18:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:18:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:18:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:18:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:18:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:18:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:18:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:18:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:18:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:18:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:18:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:18:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:18:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:18:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:18:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:18:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 04:18:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 04:18:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:18:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:18:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 04:18:18,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:18:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151710669] [2024-11-07 04:18:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151710669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:18:18,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:18:18,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:18:18,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748668674] [2024-11-07 04:18:18,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:18:18,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:18:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:18:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:18:18,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:18:18,540 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 54 states have internal predecessors, (69), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 04:18:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:18:18,580 INFO L93 Difference]: Finished difference Result 169 states and 292 transitions. [2024-11-07 04:18:18,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:18:18,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2024-11-07 04:18:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:18:18,591 INFO L225 Difference]: With dead ends: 169 [2024-11-07 04:18:18,592 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 04:18:18,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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 04:18:18,600 INFO L432 NwaCegarLoop]: 126 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, 126 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 04:18:18,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:18:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 04:18:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 04:18:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 04:18:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-11-07 04:18:18,654 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 198 [2024-11-07 04:18:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:18:18,656 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-11-07 04:18:18,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 04:18:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-11-07 04:18:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-07 04:18:18,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:18:18,662 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:18,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:18:18,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:18:18,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:18:18,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1057692953, now seen corresponding path program 1 times [2024-11-07 04:18:18,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:18:18,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422477779] [2024-11-07 04:18:18,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:18:18,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:18:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:18:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:18:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:18:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:18:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:18:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:18:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:18:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:18:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:18:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:18:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:18:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:18:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:18:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:18:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:18:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:18:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:18:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:18:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:18:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:18:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:18:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:18:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:18:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:18:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:18:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:18:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:18:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:18:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 04:18:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 04:18:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:18:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:18:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:26,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 04:18:26,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:18:26,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422477779] [2024-11-07 04:18:26,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422477779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:18:26,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:18:26,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 04:18:26,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481261102] [2024-11-07 04:18:26,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:18:26,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 04:18:26,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:18:26,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 04:18:26,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:18:26,748 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 04:18:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:18:27,221 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2024-11-07 04:18:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 04:18:27,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-07 04:18:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:18:27,224 INFO L225 Difference]: With dead ends: 222 [2024-11-07 04:18:27,224 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 04:18:27,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:18:27,226 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 90 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:18:27,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 391 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 04:18:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 04:18:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2024-11-07 04:18:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 78 states have internal predecessors, (99), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:18:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 167 transitions. [2024-11-07 04:18:27,257 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 167 transitions. Word has length 198 [2024-11-07 04:18:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:18:27,258 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 167 transitions. [2024-11-07 04:18:27,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 04:18:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 167 transitions. [2024-11-07 04:18:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-07 04:18:27,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:18:27,261 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:27,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:18:27,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:18:27,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:18:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1644498967, now seen corresponding path program 1 times [2024-11-07 04:18:27,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:18:27,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498633462] [2024-11-07 04:18:27,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:18:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:18:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:18:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:18:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:18:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:18:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:18:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:18:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:18:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:18:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:18:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:18:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:18:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:18:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:18:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:18:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:18:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:18:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:18:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:18:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:18:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:18:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:18:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:18:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:18:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:18:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:18:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:18:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:18:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:18:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 04:18:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 04:18:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:18:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:18:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 04:18:33,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:18:33,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498633462] [2024-11-07 04:18:33,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498633462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:18:33,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:18:33,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 04:18:33,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096738224] [2024-11-07 04:18:33,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:18:33,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 04:18:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:18:33,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 04:18:33,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:18:33,188 INFO L87 Difference]: Start difference. First operand 114 states and 167 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 04:18:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:18:33,816 INFO L93 Difference]: Finished difference Result 249 states and 364 transitions. [2024-11-07 04:18:33,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 04:18:33,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-07 04:18:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:18:33,822 INFO L225 Difference]: With dead ends: 249 [2024-11-07 04:18:33,822 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 04:18:33,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 04:18:33,825 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 25 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:18:33,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 555 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 04:18:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 04:18:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2024-11-07 04:18:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 89 states have internal predecessors, (116), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:18:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 184 transitions. [2024-11-07 04:18:33,848 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 184 transitions. Word has length 198 [2024-11-07 04:18:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:18:33,849 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 184 transitions. [2024-11-07 04:18:33,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 04:18:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 184 transitions. [2024-11-07 04:18:33,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-07 04:18:33,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:18:33,853 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:33,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:18:33,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:18:33,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:18:33,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1957410665, now seen corresponding path program 1 times [2024-11-07 04:18:33,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:18:33,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161261317] [2024-11-07 04:18:33,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:18:33,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:18:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:18:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:18:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:18:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:18:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:18:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:18:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:18:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:18:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:18:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:18:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:18:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:18:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:33,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:18:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:18:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:18:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:18:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:18:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:18:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:18:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:18:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:18:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:18:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:18:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:18:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:18:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:18:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:18:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:18:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 04:18:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 04:18:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:18:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:18:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 04:18:34,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:18:34,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161261317] [2024-11-07 04:18:34,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161261317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:18:34,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:18:34,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:18:34,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383288026] [2024-11-07 04:18:34,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:18:34,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:18:34,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:18:34,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:18:34,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:18:34,051 INFO L87 Difference]: Start difference. First operand 125 states and 184 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 04:18:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:18:34,101 INFO L93 Difference]: Finished difference Result 260 states and 380 transitions. [2024-11-07 04:18:34,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:18:34,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-07 04:18:34,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:18:34,103 INFO L225 Difference]: With dead ends: 260 [2024-11-07 04:18:34,103 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 04:18:34,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:18:34,105 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 34 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:18:34,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 557 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:18:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 04:18:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2024-11-07 04:18:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 89 states have internal predecessors, (115), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:18:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2024-11-07 04:18:34,134 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 183 transitions. Word has length 198 [2024-11-07 04:18:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:18:34,134 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 183 transitions. [2024-11-07 04:18:34,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 04:18:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 183 transitions. [2024-11-07 04:18:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-07 04:18:34,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:18:34,138 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:34,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:18:34,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:18:34,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:18:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1370604651, now seen corresponding path program 1 times [2024-11-07 04:18:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:18:34,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063172358] [2024-11-07 04:18:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:18:34,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:18:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:18:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:18:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:18:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:18:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:18:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:18:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:18:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:18:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:18:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:18:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:18:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:18:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:18:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:18:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:18:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:18:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:18:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:18:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:18:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:18:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:18:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:18:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:18:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:18:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:18:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:18:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:18:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:18:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 04:18:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 04:18:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 04:18:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 04:18:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 04:18:36,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:18:36,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063172358] [2024-11-07 04:18:36,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063172358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:18:36,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:18:36,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 04:18:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359542399] [2024-11-07 04:18:36,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:18:36,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 04:18:36,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:18:36,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 04:18:36,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:18:36,166 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 04:18:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:18:36,495 INFO L93 Difference]: Finished difference Result 260 states and 378 transitions. [2024-11-07 04:18:36,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 04:18:36,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-07 04:18:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:18:36,497 INFO L225 Difference]: With dead ends: 260 [2024-11-07 04:18:36,497 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 04:18:36,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 04:18:36,499 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 64 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:18:36,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 560 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 04:18:36,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 04:18:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2024-11-07 04:18:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 78 states have internal predecessors, (97), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 04:18:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-11-07 04:18:36,520 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 198 [2024-11-07 04:18:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:18:36,521 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-11-07 04:18:36,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 04:18:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-11-07 04:18:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-07 04:18:36,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:18:36,525 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:36,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:18:36,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:18:36,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:18:36,526 INFO L85 PathProgramCache]: Analyzing trace with hash -915804488, now seen corresponding path program 1 times [2024-11-07 04:18:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:18:36,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136851206] [2024-11-07 04:18:36,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:18:36,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:18:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:18:36,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985927869] [2024-11-07 04:18:36,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:18:36,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:18:36,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:18:36,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:18:36,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 04:18:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:18:36,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:18:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:18:36,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:18:36,922 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:18:36,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:18:36,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 04:18:37,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:18:37,129 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 04:18:37,260 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:18:37,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:18:37 BoogieIcfgContainer [2024-11-07 04:18:37,265 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:18:37,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:18:37,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:18:37,267 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:18:37,267 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:18:17" (3/4) ... [2024-11-07 04:18:37,269 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:18:37,270 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:18:37,273 INFO L158 Benchmark]: Toolchain (without parser) took 20490.63ms. Allocated memory was 100.7MB in the beginning and 587.2MB in the end (delta: 486.5MB). Free memory was 77.1MB in the beginning and 304.0MB in the end (delta: -227.0MB). Peak memory consumption was 254.7MB. Max. memory is 16.1GB. [2024-11-07 04:18:37,273 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:18:37,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.97ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 61.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:18:37,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.26ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 57.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:18:37,274 INFO L158 Benchmark]: Boogie Preprocessor took 89.75ms. Allocated memory is still 100.7MB. Free memory was 57.6MB in the beginning and 51.4MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:18:37,274 INFO L158 Benchmark]: RCFGBuilder took 593.40ms. Allocated memory is still 100.7MB. Free memory was 51.4MB in the beginning and 63.2MB in the end (delta: -11.9MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-07 04:18:37,274 INFO L158 Benchmark]: TraceAbstraction took 19389.86ms. Allocated memory was 100.7MB in the beginning and 587.2MB in the end (delta: 486.5MB). Free memory was 62.8MB in the beginning and 308.2MB in the end (delta: -245.4MB). Peak memory consumption was 241.6MB. Max. memory is 16.1GB. [2024-11-07 04:18:37,274 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 587.2MB. Free memory was 308.2MB in the beginning and 304.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:18:37,275 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.18ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.97ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 61.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.26ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 57.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 89.75ms. Allocated memory is still 100.7MB. Free memory was 57.6MB in the beginning and 51.4MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 593.40ms. Allocated memory is still 100.7MB. Free memory was 51.4MB in the beginning and 63.2MB in the end (delta: -11.9MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19389.86ms. Allocated memory was 100.7MB in the beginning and 587.2MB in the end (delta: 486.5MB). Free memory was 62.8MB in the beginning and 308.2MB in the end (delta: -245.4MB). Peak memory consumption was 241.6MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 587.2MB. Free memory was 308.2MB in the beginning and 304.0MB in the end (delta: 4.2MB). 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 139, overapproximation of someBinaryArithmeticDOUBLEoperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 10; [L23] signed long int var_1_2 = -500; [L24] signed char var_1_3 = 1; [L25] signed char var_1_4 = 100; [L26] signed char var_1_5 = 5; [L27] signed char var_1_6 = 32; [L28] signed char var_1_7 = 32; [L29] unsigned short int var_1_8 = 8; [L30] unsigned short int var_1_9 = 25; [L31] unsigned short int var_1_10 = 21451; [L32] unsigned short int var_1_11 = 16; [L33] unsigned char var_1_12 = 8; [L34] unsigned short int var_1_13 = 16; [L35] unsigned char var_1_14 = 1; [L36] signed long int var_1_15 = 0; [L37] unsigned short int var_1_16 = 53444; [L38] unsigned char var_1_17 = 0; [L39] unsigned char var_1_18 = 0; [L40] double var_1_19 = 1.2; [L41] signed char var_1_20 = 1; [L42] double var_1_21 = 10.5; [L43] double var_1_22 = 0.0; [L44] double var_1_23 = 10.4; [L45] double var_1_24 = 50.5; [L46] unsigned short int var_1_25 = 2; VAL [isInitial=0, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=-500, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L86] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L87] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L87] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L88] var_1_3 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_3 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L89] RET assume_abort_if_not(var_1_3 >= -127) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L90] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L90] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L91] var_1_4 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L92] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L93] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L93] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L94] var_1_5 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L95] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L96] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L96] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=32, var_1_7=32, var_1_8=8, var_1_9=25] [L97] var_1_6 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=32, var_1_8=8, var_1_9=25] [L98] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=32, var_1_8=8, var_1_9=25] [L99] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=32, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=32, var_1_8=8, var_1_9=25] [L99] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=32, var_1_8=8, var_1_9=25] [L100] var_1_7 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=25] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=25] [L102] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=25] [L102] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=25] [L103] var_1_9 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8] [L104] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8] [L105] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L105] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=21451, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L106] var_1_10 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L107] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, var_1_10=-32831, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L108] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L108] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, var_1_10=-32831, var_1_11=16, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L109] var_1_11 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L110] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-32831, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L111] CALL assume_abort_if_not(var_1_11 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L111] RET assume_abort_if_not(var_1_11 <= 16383) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=1, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L112] var_1_14 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L113] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L114] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L114] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=0, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L115] var_1_15 = __VERIFIER_nondet_long() [L116] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L116] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L117] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L117] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L118] var_1_16 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L119] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L120] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L120] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L121] var_1_18 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L122] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L123] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L123] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L124] var_1_20 = __VERIFIER_nondet_char() [L125] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L125] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L126] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L126] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L127] var_1_21 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L128] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L129] var_1_22 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L130] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L131] var_1_23 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L132] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_24=101/2, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L133] var_1_24 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L134] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L147] RET updateVariables() [L148] CALL step() [L50] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, stepLocal_0=-1000000, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L51] COND TRUE var_1_2 >= stepLocal_0 [L52] var_1_1 = ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=8, var_1_9=33] [L56] var_1_8 = (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11)) [L57] signed long int stepLocal_1 = var_1_2; VAL [isInitial=1, stepLocal_1=32800, var_1_10=-32831, var_1_11=32, var_1_12=8, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L58] COND TRUE var_1_8 == stepLocal_1 [L59] var_1_12 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L61] signed long int stepLocal_2 = var_1_15; VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=16, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L62] COND FALSE !(\read(var_1_14)) [L69] var_1_13 = (var_1_16 - var_1_10) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=62, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L71] COND TRUE ((((((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) < (var_1_8)) ? (((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) : (var_1_8))) > (var_1_3 * var_1_12) [L72] var_1_17 = var_1_18 VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=62, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L74] signed long int stepLocal_3 = var_1_5 - var_1_20; VAL [isInitial=1, stepLocal_2=-2147483648, stepLocal_3=0, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=62, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L75] COND TRUE var_1_1 >= stepLocal_3 [L76] var_1_19 = (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=62, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=2, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L78] COND TRUE (var_1_13 < var_1_12) || var_1_14 [L79] var_1_25 = (((((var_1_11) > (var_1_9)) ? (var_1_11) : (var_1_9))) + var_1_7) VAL [isInitial=1, stepLocal_2=-2147483648, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=62, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=96, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR ((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=62, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=96, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L139] EXPR var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=62, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=96, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L139] EXPR ((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=62, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=96, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L139-L140] return (((((((var_1_2 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_9) + (var_1_10 - var_1_11))))) && ((var_1_8 == var_1_2) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_14 ? ((((var_1_10 + var_1_9) << var_1_5) < var_1_15) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))) ? (var_1_12) : (((((var_1_9) < (var_1_6)) ? (var_1_9) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_9 + var_1_11))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))))) && ((((((((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) < (var_1_8)) ? (((((var_1_11) > (var_1_6)) ? (var_1_11) : (var_1_6)))) : (var_1_8))) > (var_1_3 * var_1_12)) ? (var_1_17 == ((unsigned char) var_1_18)) : 1)) && ((var_1_1 >= (var_1_5 - var_1_20)) ? (var_1_19 == ((double) (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24))) : 1)) && (((var_1_13 < var_1_12) || var_1_14) ? (var_1_25 == ((unsigned short int) (((((var_1_11) > (var_1_9)) ? (var_1_11) : (var_1_9))) + var_1_7))) : (var_1_25 == ((unsigned short int) var_1_7))) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=62, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=96, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] [L19] reach_error() VAL [isInitial=1, var_1_10=-32831, var_1_11=32, var_1_12=63, var_1_13=62, var_1_14=0, var_1_15=-2147483648, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=0, var_1_20=0, var_1_25=96, var_1_2=32800, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=31, var_1_7=63, var_1_8=32800, var_1_9=33] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 6, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 213 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 2189 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1554 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 583 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 635 mSDtfsCounter, 583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=3, InterpolantAutomatonStates: 26, 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, 5 MinimizatonAttempts, 77 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 1390 NumberOfCodeBlocks, 1390 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 985 ConstructedInterpolants, 0 QuantifiedInterpolants, 9439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 9920/9920 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 04:18:37,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_codestructure_steplocals_file-21.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 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:18:39,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:18:39,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:18:39,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:18:39,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:18:39,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:18:39,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:18:39,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:18:39,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:18:39,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:18:39,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:18:39,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:18:39,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:18:39,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:18:39,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:18:39,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:18:39,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:18:39,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:18:39,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:18:39,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:18:39,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:18:39,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:18:39,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:18:39,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:18:39,658 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:18:39,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:18:39,658 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:18:39,658 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:18:39,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:18:39,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:18:39,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:18:39,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:18:39,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:18:39,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:18:39,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:18:39,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:18:39,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:18:39,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:18:39,660 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:18:39,660 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:18:39,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:18:39,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:18:39,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:18:39,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:18:39,661 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 -> 28a2314d0eb39c8d888aa07b1b8fb1747bceaf1ce795da8e04052ca9dd24aac3 [2024-11-07 04:18:39,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:18:39,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:18:39,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:18:39,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:18:39,925 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:18:39,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-11-07 04:18:41,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:18:41,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:18:41,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-21.i [2024-11-07 04:18:41,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea3766a12/f497816cc621469493dfca8ce1d658ec/FLAG7c497ce7e [2024-11-07 04:18:41,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea3766a12/f497816cc621469493dfca8ce1d658ec [2024-11-07 04:18:41,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:18:41,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:18:41,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:18:41,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:18:41,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:18:41,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:41,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c36d4c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41, skipping insertion in model container [2024-11-07 04:18:41,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:41,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:18:41,745 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_codestructure_steplocals_file-21.i[917,930] [2024-11-07 04:18:41,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:18:41,844 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:18:41,857 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_codestructure_steplocals_file-21.i[917,930] [2024-11-07 04:18:41,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:18:41,911 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:18:41,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41 WrapperNode [2024-11-07 04:18:41,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:18:41,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:18:41,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:18:41,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:18:41,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:41,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:41,959 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-11-07 04:18:41,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:18:41,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:18:41,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:18:41,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:18:41,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:41,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:41,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:41,994 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:18:41,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:41,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:42,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:42,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:42,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:42,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:42,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:18:42,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:18:42,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:18:42,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:18:42,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (1/1) ... [2024-11-07 04:18:42,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:18:42,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:18:42,047 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 04:18:42,052 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 04:18:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:18:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:18:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:18:42,072 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:18:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:18:42,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:18:42,144 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:18:42,146 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:18:42,977 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 04:18:42,977 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:18:42,988 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:18:42,988 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:18:42,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:18:42 BoogieIcfgContainer [2024-11-07 04:18:42,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:18:42,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:18:42,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:18:42,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:18:42,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:18:41" (1/3) ... [2024-11-07 04:18:42,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0ef1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:18:42, skipping insertion in model container [2024-11-07 04:18:42,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:18:41" (2/3) ... [2024-11-07 04:18:42,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0ef1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:18:42, skipping insertion in model container [2024-11-07 04:18:42,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:18:42" (3/3) ... [2024-11-07 04:18:42,998 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-21.i [2024-11-07 04:18:43,010 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:18:43,011 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:18:43,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:18:43,070 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;@27991dba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:18:43,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:18:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 04:18:43,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-07 04:18:43,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:18:43,086 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:43,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:18:43,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:18:43,089 INFO L85 PathProgramCache]: Analyzing trace with hash -799388562, now seen corresponding path program 1 times [2024-11-07 04:18:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:18:43,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456559967] [2024-11-07 04:18:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:18:43,098 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 04:18:43,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:18:43,101 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 04:18:43,102 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 04:18:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:43,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:18:43,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:18:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-07 04:18:43,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:18:43,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:18:43,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456559967] [2024-11-07 04:18:43,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456559967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:18:43,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:18:43,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:18:43,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594824192] [2024-11-07 04:18:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:18:43,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:18:43,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:18:43,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:18:43,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:18:43,566 INFO L87 Difference]: Start difference. First operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 04:18:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:18:43,598 INFO L93 Difference]: Finished difference Result 151 states and 266 transitions. [2024-11-07 04:18:43,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:18:43,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2024-11-07 04:18:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:18:43,609 INFO L225 Difference]: With dead ends: 151 [2024-11-07 04:18:43,609 INFO L226 Difference]: Without dead ends: 75 [2024-11-07 04:18:43,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 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 04:18:43,614 INFO L432 NwaCegarLoop]: 113 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, 113 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 04:18:43,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:18:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-07 04:18:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-07 04:18:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 04:18:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2024-11-07 04:18:43,663 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 196 [2024-11-07 04:18:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:18:43,664 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2024-11-07 04:18:43,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 04:18:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2024-11-07 04:18:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-07 04:18:43,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:18:43,667 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:43,678 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 (2)] Ended with exit code 0 [2024-11-07 04:18:43,868 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 04:18:43,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:18:43,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:18:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash -851604618, now seen corresponding path program 1 times [2024-11-07 04:18:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:18:43,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332306146] [2024-11-07 04:18:43,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:18:43,871 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 04:18:43,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:18:43,873 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 04:18:43,875 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 04:18:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:18:45,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-07 04:18:45,484 INFO L278 TraceCheckSpWp]: Computing forward predicates...