./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-6.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_fillercode_fillercodestructure_normal_file-6.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', '4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00'] 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_fillercode_fillercodestructure_normal_file-6.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 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:28:19,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:28:19,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:28:19,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:28:19,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:28:19,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:28:19,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:28:19,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:28:19,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:28:19,759 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:28:19,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:28:19,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:28:19,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:28:19,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:28:19,760 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:28:19,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:28:19,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:28:19,760 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:28:19,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:28:19,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:28:19,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:28:19,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:28:19,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:28:19,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:28:19,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:28:19,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:28:19,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:28:19,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:28:19,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:28:19,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:28:19,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:28:19,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:28:19,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:28:19,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:28:19,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:28:19,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:28:19,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:28:19,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:28:19,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:28:19,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:28:19,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:28:19,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:28:19,763 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 -> 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 [2024-11-07 07:28:20,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:28:20,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:28:20,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:28:20,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:28:20,059 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:28:20,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-6.i [2024-11-07 07:28:21,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:28:21,636 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:28:21,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-6.i [2024-11-07 07:28:21,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65ea511c0/fbaa49cd5a394d8f973673ec1cc41683/FLAG26decb0b3 [2024-11-07 07:28:21,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65ea511c0/fbaa49cd5a394d8f973673ec1cc41683 [2024-11-07 07:28:21,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:28:21,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:28:21,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:28:21,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:28:21,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:28:21,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:21,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398d28ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21, skipping insertion in model container [2024-11-07 07:28:21,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:21,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:28:21,823 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_fillercode_fillercodestructure_normal_file-6.i[912,925] [2024-11-07 07:28:21,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:28:21,892 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:28:21,901 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_fillercode_fillercodestructure_normal_file-6.i[912,925] [2024-11-07 07:28:21,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:28:21,938 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:28:21,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21 WrapperNode [2024-11-07 07:28:21,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:28:21,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:28:21,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:28:21,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:28:21,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:21,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:21,987 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-07 07:28:21,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:28:21,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:28:21,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:28:21,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:28:21,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:21,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:21,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:22,011 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 07:28:22,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:22,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:22,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:22,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:22,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:22,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:22,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:28:22,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:28:22,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:28:22,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:28:22,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (1/1) ... [2024-11-07 07:28:22,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:28:22,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:28:22,066 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 07:28:22,071 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 07:28:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:28:22,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:28:22,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:28:22,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:28:22,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:28:22,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:28:22,151 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:28:22,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:28:22,369 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 07:28:22,370 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:28:22,381 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:28:22,382 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:28:22,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:28:22 BoogieIcfgContainer [2024-11-07 07:28:22,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:28:22,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:28:22,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:28:22,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:28:22,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:28:21" (1/3) ... [2024-11-07 07:28:22,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9f905d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:28:22, skipping insertion in model container [2024-11-07 07:28:22,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:21" (2/3) ... [2024-11-07 07:28:22,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9f905d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:28:22, skipping insertion in model container [2024-11-07 07:28:22,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:28:22" (3/3) ... [2024-11-07 07:28:22,393 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-6.i [2024-11-07 07:28:22,405 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:28:22,406 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:28:22,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:28:22,475 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;@633fdf6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:28:22,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:28:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 07:28:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 07:28:22,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:22,485 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:22,486 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:22,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1507269492, now seen corresponding path program 1 times [2024-11-07 07:28:22,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:22,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504678321] [2024-11-07 07:28:22,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:22,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:28:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:28:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 07:28:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:28:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 07:28:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:28:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:28:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 07:28:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:28:22,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:22,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504678321] [2024-11-07 07:28:22,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504678321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:22,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:28:22,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695320364] [2024-11-07 07:28:22,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:22,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:28:22,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:22,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:28:22,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:28:22,856 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 07:28:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:22,872 INFO L93 Difference]: Finished difference Result 99 states and 161 transitions. [2024-11-07 07:28:22,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:28:22,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2024-11-07 07:28:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:22,881 INFO L225 Difference]: With dead ends: 99 [2024-11-07 07:28:22,882 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 07:28:22,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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 07:28:22,887 INFO L432 NwaCegarLoop]: 70 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, 70 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 07:28:22,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:28:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 07:28:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-07 07:28:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 07:28:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-07 07:28:22,926 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 91 [2024-11-07 07:28:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:22,926 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-07 07:28:22,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 07:28:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-07 07:28:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 07:28:22,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:22,932 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:22,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:28:22,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:22,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:22,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1317533642, now seen corresponding path program 1 times [2024-11-07 07:28:22,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:22,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962683094] [2024-11-07 07:28:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:22,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:28:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:28:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 07:28:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:28:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 07:28:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:28:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:28:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 07:28:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:28:23,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962683094] [2024-11-07 07:28:23,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962683094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:23,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:23,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:28:23,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285136785] [2024-11-07 07:28:23,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:23,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:28:23,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:23,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:28:23,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:28:23,444 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:28:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:23,581 INFO L93 Difference]: Finished difference Result 142 states and 205 transitions. [2024-11-07 07:28:23,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:28:23,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-11-07 07:28:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:23,584 INFO L225 Difference]: With dead ends: 142 [2024-11-07 07:28:23,586 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 07:28:23,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:28:23,587 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:23,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 194 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:28:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 07:28:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2024-11-07 07:28:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 07:28:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-11-07 07:28:23,614 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 91 [2024-11-07 07:28:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:23,614 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-11-07 07:28:23,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:28:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-11-07 07:28:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 07:28:23,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:23,617 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:23,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:28:23,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2120436618, now seen corresponding path program 1 times [2024-11-07 07:28:23,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:23,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859942997] [2024-11-07 07:28:23,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:28:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:28:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 07:28:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:28:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 07:28:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:28:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:28:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 07:28:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:28:24,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859942997] [2024-11-07 07:28:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859942997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:24,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:24,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:28:24,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019760172] [2024-11-07 07:28:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:24,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:28:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:24,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:28:24,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:28:24,134 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:28:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:24,404 INFO L93 Difference]: Finished difference Result 203 states and 286 transitions. [2024-11-07 07:28:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:28:24,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-11-07 07:28:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:24,407 INFO L225 Difference]: With dead ends: 203 [2024-11-07 07:28:24,407 INFO L226 Difference]: Without dead ends: 157 [2024-11-07 07:28:24,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:28:24,408 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:24,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 205 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:28:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-07 07:28:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2024-11-07 07:28:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 100 states have (on average 1.23) internal successors, (123), 101 states have internal predecessors, (123), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 07:28:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 215 transitions. [2024-11-07 07:28:24,452 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 215 transitions. Word has length 92 [2024-11-07 07:28:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:24,453 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 215 transitions. [2024-11-07 07:28:24,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:28:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 215 transitions. [2024-11-07 07:28:24,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 07:28:24,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:24,456 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:24,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:28:24,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:24,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash 399523316, now seen corresponding path program 1 times [2024-11-07 07:28:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:24,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335230426] [2024-11-07 07:28:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:24,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:28:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:28:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:28:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 07:28:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:28:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 07:28:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:28:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:28:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:28:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 07:28:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 07:28:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:28:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 07:28:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-07 07:28:24,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:28:24,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335230426] [2024-11-07 07:28:24,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335230426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:28:24,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66492334] [2024-11-07 07:28:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:24,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:28:24,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:28:24,954 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 07:28:24,956 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 07:28:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:25,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 07:28:25,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:28:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-07 07:28:25,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:28:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66492334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:25,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 07:28:25,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-07 07:28:25,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773547144] [2024-11-07 07:28:25,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:25,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:28:25,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:28:25,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:28:25,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:28:25,213 INFO L87 Difference]: Start difference. First operand 152 states and 215 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 07:28:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:25,669 INFO L93 Difference]: Finished difference Result 424 states and 581 transitions. [2024-11-07 07:28:25,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 07:28:25,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2024-11-07 07:28:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:25,677 INFO L225 Difference]: With dead ends: 424 [2024-11-07 07:28:25,678 INFO L226 Difference]: Without dead ends: 308 [2024-11-07 07:28:25,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-07 07:28:25,682 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 103 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:28:25,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 304 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:28:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-07 07:28:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2024-11-07 07:28:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 208 states have (on average 1.2067307692307692) internal successors, (251), 210 states have internal predecessors, (251), 79 states have call successors, (79), 18 states have call predecessors, (79), 18 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-07 07:28:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 409 transitions. [2024-11-07 07:28:25,758 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 409 transitions. Word has length 92 [2024-11-07 07:28:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:25,759 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 409 transitions. [2024-11-07 07:28:25,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 07:28:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 409 transitions. [2024-11-07 07:28:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 07:28:25,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:25,764 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:25,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 07:28:25,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:28:25,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:25,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash 657688754, now seen corresponding path program 1 times [2024-11-07 07:28:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:28:25,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772078193] [2024-11-07 07:28:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:25,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:28:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:28:26,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007713764] [2024-11-07 07:28:26,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:26,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:28:26,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:28:26,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:28:26,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 07:28:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:28:26,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:28:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:28:26,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:28:26,251 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:28:26,252 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:28:26,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 07:28:26,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:28:26,460 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 07:28:26,551 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:28:26,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:28:26 BoogieIcfgContainer [2024-11-07 07:28:26,555 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:28:26,556 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:28:26,556 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:28:26,556 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:28:26,557 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:28:22" (3/4) ... [2024-11-07 07:28:26,560 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:28:26,560 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:28:26,562 INFO L158 Benchmark]: Toolchain (without parser) took 4887.69ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 92.0MB in the beginning and 73.2MB in the end (delta: 18.8MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2024-11-07 07:28:26,562 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:28:26,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.53ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 78.6MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:28:26,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.91ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:28:26,564 INFO L158 Benchmark]: Boogie Preprocessor took 35.71ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 74.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:28:26,564 INFO L158 Benchmark]: RCFGBuilder took 357.63ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 59.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:28:26,564 INFO L158 Benchmark]: TraceAbstraction took 4169.81ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 59.0MB in the beginning and 73.2MB in the end (delta: -14.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-07 07:28:26,564 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 159.4MB. Free memory was 73.2MB in the beginning and 73.2MB in the end (delta: 57.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:28:26,566 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.19ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.53ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 78.6MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.91ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.71ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 74.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 357.63ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 59.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4169.81ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 59.0MB in the beginning and 73.2MB in the end (delta: -14.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 159.4MB. Free memory was 73.2MB in the beginning and 73.2MB in the end (delta: 57.7kB). 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 117, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 100.25; [L23] double var_1_5 = 1.9; [L24] double var_1_6 = 7.5; [L25] double var_1_7 = 64.25; [L26] signed long int var_1_8 = 2; [L27] signed long int var_1_9 = 1000000000; [L28] signed long int var_1_10 = 1000000000; [L29] signed long int var_1_11 = 1957998270; [L30] float var_1_12 = 50.25; [L31] float var_1_13 = 9.8; [L32] float var_1_14 = 25.5; [L33] float var_1_15 = 3.5; [L34] signed long int var_1_16 = -500; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] double last_1_var_1_1 = 100.25; [L39] signed long int last_1_var_1_8 = 2; [L40] float last_1_var_1_12 = 50.25; [L41] signed long int last_1_var_1_16 = -500; [L42] unsigned char last_1_var_1_17 = 1; [L43] unsigned char last_1_var_1_19 = 0; VAL [isInitial=0, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L109] last_1_var_1_1 = var_1_1 [L110] last_1_var_1_8 = var_1_8 [L111] last_1_var_1_12 = var_1_12 [L112] last_1_var_1_16 = var_1_16 [L113] last_1_var_1_17 = var_1_17 [L114] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L85] var_1_5 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L86] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L87] var_1_6 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L88] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L89] var_1_7 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L90] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L91] var_1_9 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L92] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L94] var_1_10 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L95] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L97] var_1_11 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L98] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L99] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L99] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L100] var_1_14 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L101] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L103] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L104] var_1_18 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L105] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L106] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L106] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L125] RET updateVariables() [L126] CALL step() [L47] COND TRUE \read(last_1_var_1_17) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L48] COND FALSE !(var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L54] COND FALSE !((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L61] var_1_8 = (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16))))) [L62] signed long int stepLocal_1 = (((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9)); VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_1=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=999, var_1_9=536870911] [L63] COND TRUE stepLocal_1 >= (var_1_16 - var_1_11) [L64] var_1_12 = var_1_7 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L66] var_1_17 = (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18) [L67] signed long int stepLocal_2 = var_1_16; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_2=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L68] COND TRUE stepLocal_2 < var_1_11 [L69] var_1_13 = ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L73] signed long int stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L74] COND FALSE !(\read(var_1_19)) [L81] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L126] RET step() [L127] CALL, EXPR property() [L117-L118] return ((((((var_1_19 ? ((var_1_8 >= var_1_8) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16)))))))) && ((((((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9))) >= (var_1_16 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_16 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((last_1_var_1_8) < (var_1_10)) ? (last_1_var_1_8) : (var_1_10)))) ? (last_1_var_1_19 ? (var_1_16 == ((signed long int) last_1_var_1_8)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (last_1_var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 773 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 390 IncrementalHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 283 mSDtfsCounter, 390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 25 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 642 NumberOfCodeBlocks, 642 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 914 SizeOfPredicates, 1 NumberOfNonLiveVariables, 248 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1557/1560 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 07:28:26,598 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_fillercode_fillercodestructure_normal_file-6.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 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:28:28,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:28:28,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:28:28,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:28:28,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:28:28,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:28:28,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:28:28,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:28:28,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:28:28,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:28:28,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:28:28,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:28:28,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:28:28,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:28:28,874 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:28:28,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:28:28,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:28:28,875 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:28:28,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:28:28,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:28:28,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:28:28,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:28:28,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:28:28,881 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:28:28,881 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:28:28,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:28:28,881 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:28:28,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:28:28,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:28:28,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:28:28,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:28:28,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:28:28,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:28:28,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:28:28,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:28:28,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:28:28,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:28:28,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:28:28,882 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:28:28,882 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:28:28,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:28:28,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:28:28,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:28:28,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:28:28,883 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 -> 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 [2024-11-07 07:28:29,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:28:29,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:28:29,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:28:29,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:28:29,138 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:28:29,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-6.i [2024-11-07 07:28:30,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:28:30,645 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:28:30,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-6.i [2024-11-07 07:28:30,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb630adff/6e6da1af899e405ab9af6f0eb67cb95a/FLAG40646bb83 [2024-11-07 07:28:30,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb630adff/6e6da1af899e405ab9af6f0eb67cb95a [2024-11-07 07:28:30,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:28:30,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:28:30,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:28:30,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:28:30,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:28:30,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:30,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6aeaa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30, skipping insertion in model container [2024-11-07 07:28:30,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:30,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:28:30,834 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_fillercode_fillercodestructure_normal_file-6.i[912,925] [2024-11-07 07:28:30,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:28:30,911 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:28:30,921 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_fillercode_fillercodestructure_normal_file-6.i[912,925] [2024-11-07 07:28:30,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:28:30,977 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:28:30,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30 WrapperNode [2024-11-07 07:28:30,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:28:30,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:28:30,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:28:30,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:28:30,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:30,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:31,022 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-07 07:28:31,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:28:31,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:28:31,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:28:31,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:28:31,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:31,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:31,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:31,050 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 07:28:31,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:31,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:31,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:31,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:31,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:31,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:31,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:28:31,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:28:31,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:28:31,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:28:31,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (1/1) ... [2024-11-07 07:28:31,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:28:31,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:28:31,109 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 07:28:31,115 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 07:28:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:28:31,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:28:31,132 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:28:31,132 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:28:31,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:28:31,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:28:31,216 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:28:31,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:28:49,991 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 07:28:49,991 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:28:50,000 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:28:50,000 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:28:50,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:28:50 BoogieIcfgContainer [2024-11-07 07:28:50,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:28:50,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:28:50,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:28:50,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:28:50,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:28:30" (1/3) ... [2024-11-07 07:28:50,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c6a3c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:28:50, skipping insertion in model container [2024-11-07 07:28:50,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:28:30" (2/3) ... [2024-11-07 07:28:50,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c6a3c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:28:50, skipping insertion in model container [2024-11-07 07:28:50,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:28:50" (3/3) ... [2024-11-07 07:28:50,011 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-6.i [2024-11-07 07:28:50,024 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:28:50,024 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:28:50,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:28:50,092 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;@51b6e4f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:28:50,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:28:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 07:28:50,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 07:28:50,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:50,107 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:50,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:50,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:50,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1507269492, now seen corresponding path program 1 times [2024-11-07 07:28:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:28:50,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097431653] [2024-11-07 07:28:50,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:50,126 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 07:28:50,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:28:50,132 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 07:28:50,133 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 07:28:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:50,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:28:50,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:28:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 07:28:50,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:28:50,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:28:50,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097431653] [2024-11-07 07:28:50,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097431653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:50,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:50,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:28:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708205394] [2024-11-07 07:28:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:50,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:28:50,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:28:50,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:28:50,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:28:50,919 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 07:28:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:28:50,943 INFO L93 Difference]: Finished difference Result 99 states and 161 transitions. [2024-11-07 07:28:50,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:28:50,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2024-11-07 07:28:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:28:50,952 INFO L225 Difference]: With dead ends: 99 [2024-11-07 07:28:50,952 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 07:28:50,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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 07:28:50,959 INFO L432 NwaCegarLoop]: 70 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, 70 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 07:28:50,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:28:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 07:28:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-07 07:28:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 07:28:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-07 07:28:50,998 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 91 [2024-11-07 07:28:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:28:50,999 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-07 07:28:50,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 07:28:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-07 07:28:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 07:28:51,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:28:51,004 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:51,028 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 07:28:51,205 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 07:28:51,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:28:51,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:28:51,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1317533642, now seen corresponding path program 1 times [2024-11-07 07:28:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:28:51,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612612124] [2024-11-07 07:28:51,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:28:51,207 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 07:28:51,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:28:51,210 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 07:28:51,211 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 07:28:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:28:51,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 07:28:51,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:28:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:28:54,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:28:54,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:28:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612612124] [2024-11-07 07:28:54,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612612124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:28:54,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:28:54,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:28:54,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941052543] [2024-11-07 07:28:54,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:28:54,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:28:54,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:28:54,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:28:54,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:28:54,309 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:28:58,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:02,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:07,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:11,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:29:11,347 INFO L93 Difference]: Finished difference Result 142 states and 205 transitions. [2024-11-07 07:29:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:29:11,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-11-07 07:29:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:29:11,455 INFO L225 Difference]: With dead ends: 142 [2024-11-07 07:29:11,456 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 07:29:11,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:29:11,457 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 27 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-07 07:29:11,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 195 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 7 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2024-11-07 07:29:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 07:29:11,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2024-11-07 07:29:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 07:29:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-11-07 07:29:11,474 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 91 [2024-11-07 07:29:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:29:11,475 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-11-07 07:29:11,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:29:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-11-07 07:29:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 07:29:11,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:29:11,477 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:29:11,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 07:29:11,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:29:11,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:29:11,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:29:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2120436618, now seen corresponding path program 1 times [2024-11-07 07:29:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:29:11,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330813937] [2024-11-07 07:29:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:29:11,697 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 07:29:11,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:29:11,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:29:11,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 07:29:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:29:12,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:29:12,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:29:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 166 proven. 15 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-07 07:29:16,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:29:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-07 07:29:20,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:29:20,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330813937] [2024-11-07 07:29:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330813937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:29:20,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:29:20,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-11-07 07:29:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303435792] [2024-11-07 07:29:20,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:29:20,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 07:29:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:29:20,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 07:29:20,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:29:20,324 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-07 07:29:25,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:30,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:34,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:38,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:42,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:46,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:50,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:29:55,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []