./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.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', '280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.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 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:57:54,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:57:54,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 03:57:54,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:57:54,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:57:54,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:57:54,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:57:54,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:57:54,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:57:54,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:57:54,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:57:54,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:57:54,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:57:54,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:57:54,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:57:54,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:57:54,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:57:54,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:57:54,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:57:54,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:57:54,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:57:54,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:57:54,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:57:54,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:57:54,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:57:54,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:57:54,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:57:54,914 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 -> 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 [2024-11-07 03:57:55,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:57:55,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:57:55,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:57:55,139 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:57:55,139 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:57:55,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2024-11-07 03:57:56,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:57:56,419 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:57:56,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2024-11-07 03:57:56,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20fa5f3c9/6a90ef265e0f4e658e7a804f215c788a/FLAG23166fc3f [2024-11-07 03:57:56,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20fa5f3c9/6a90ef265e0f4e658e7a804f215c788a [2024-11-07 03:57:56,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:57:56,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:57:56,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:57:56,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:57:56,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:57:56,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ada73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56, skipping insertion in model container [2024-11-07 03:57:56,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:57:56,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i[919,932] [2024-11-07 03:57:56,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:57:56,608 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:57:56,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i[919,932] [2024-11-07 03:57:56,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:57:56,646 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:57:56,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56 WrapperNode [2024-11-07 03:57:56,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:57:56,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:57:56,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:57:56,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:57:56,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,694 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-07 03:57:56,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:57:56,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:57:56,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:57:56,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:57:56,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,725 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 03:57:56,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:57:56,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:57:56,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:57:56,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:57:56,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (1/1) ... [2024-11-07 03:57:56,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:57:56,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:57:56,784 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 03:57:56,786 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 03:57:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:57:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:57:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:57:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:57:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:57:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:57:56,872 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:57:56,874 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:57:57,091 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 03:57:57,091 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:57:57,099 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:57:57,099 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:57:57,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:57:57 BoogieIcfgContainer [2024-11-07 03:57:57,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:57:57,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:57:57,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:57:57,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:57:57,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:57:56" (1/3) ... [2024-11-07 03:57:57,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2755660a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:57:57, skipping insertion in model container [2024-11-07 03:57:57,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:57:56" (2/3) ... [2024-11-07 03:57:57,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2755660a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:57:57, skipping insertion in model container [2024-11-07 03:57:57,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:57:57" (3/3) ... [2024-11-07 03:57:57,107 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-54.i [2024-11-07 03:57:57,117 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:57:57,117 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:57:57,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:57:57,179 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;@d5639be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:57:57,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:57:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 03:57:57,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 03:57:57,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:57:57,190 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:57:57,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:57:57,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:57:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1477697952, now seen corresponding path program 1 times [2024-11-07 03:57:57,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:57:57,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495365480] [2024-11-07 03:57:57,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:57:57,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:57:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:57:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:57:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:57:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:57:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:57:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:57:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:57:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:57:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 03:57:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:57:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 03:57:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:57:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 03:57:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:57:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:57:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 03:57:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:57:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:57:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 03:57:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 03:57:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 03:57:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 03:57:57,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:57:57,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495365480] [2024-11-07 03:57:57,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495365480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:57:57,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:57:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:57:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869285562] [2024-11-07 03:57:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:57:57,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:57:57,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:57:57,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:57:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:57:57,544 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 03:57:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:57:57,563 INFO L93 Difference]: Finished difference Result 115 states and 199 transitions. [2024-11-07 03:57:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:57:57,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2024-11-07 03:57:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:57:57,569 INFO L225 Difference]: With dead ends: 115 [2024-11-07 03:57:57,570 INFO L226 Difference]: Without dead ends: 57 [2024-11-07 03:57:57,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 03:57:57,576 INFO L432 NwaCegarLoop]: 85 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, 85 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 03:57:57,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:57:57,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-07 03:57:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-07 03:57:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 03:57:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2024-11-07 03:57:57,605 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 133 [2024-11-07 03:57:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:57:57,605 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2024-11-07 03:57:57,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 03:57:57,607 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2024-11-07 03:57:57,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 03:57:57,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:57:57,610 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:57:57,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:57:57,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:57:57,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:57:57,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1808189346, now seen corresponding path program 1 times [2024-11-07 03:57:57,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:57:57,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576280068] [2024-11-07 03:57:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:57:57,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:57:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:57:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:57,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:57:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:57:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:57:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:57:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:57:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:57:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:57:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 03:57:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:57:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 03:57:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:57:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 03:57:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:57:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:57:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 03:57:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:57:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 03:57:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 03:57:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 03:57:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 03:57:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:57:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 03:57:58,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:57:58,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576280068] [2024-11-07 03:57:58,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576280068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:57:58,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:57:58,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:57:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151482038] [2024-11-07 03:57:58,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:57:58,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:57:58,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:57:58,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:57:58,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:57:58,132 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 03:57:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:57:58,285 INFO L93 Difference]: Finished difference Result 166 states and 250 transitions. [2024-11-07 03:57:58,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:57:58,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 133 [2024-11-07 03:57:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:57:58,288 INFO L225 Difference]: With dead ends: 166 [2024-11-07 03:57:58,288 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 03:57:58,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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 03:57:58,289 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:57:58,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 238 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:57:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 03:57:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2024-11-07 03:57:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-07 03:57:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2024-11-07 03:57:58,318 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 133 [2024-11-07 03:57:58,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:57:58,319 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2024-11-07 03:57:58,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 03:57:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2024-11-07 03:57:58,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 03:57:58,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:57:58,321 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:57:58,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:57:58,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:57:58,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:57:58,322 INFO L85 PathProgramCache]: Analyzing trace with hash 124102072, now seen corresponding path program 1 times [2024-11-07 03:57:58,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:57:58,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376333855] [2024-11-07 03:57:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:57:58,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:57:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 03:57:58,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526127928] [2024-11-07 03:57:58,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:57:58,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:57:58,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:57:58,507 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 03:57:58,509 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 03:57:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:57:58,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:57:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:57:58,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:57:58,970 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:57:58,970 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:57:58,986 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 03:57:59,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:57:59,176 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 03:57:59,249 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:57:59,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:57:59 BoogieIcfgContainer [2024-11-07 03:57:59,252 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:57:59,253 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:57:59,253 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:57:59,253 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:57:59,253 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:57:57" (3/4) ... [2024-11-07 03:57:59,255 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:57:59,256 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:57:59,257 INFO L158 Benchmark]: Toolchain (without parser) took 2809.46ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 43.8MB in the end (delta: 32.5MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-07 03:57:59,257 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:57:59,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.49ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 62.7MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:57:59,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.47ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 60.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:57:59,259 INFO L158 Benchmark]: Boogie Preprocessor took 52.69ms. Allocated memory is still 100.7MB. Free memory was 60.5MB in the beginning and 57.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:57:59,259 INFO L158 Benchmark]: RCFGBuilder took 348.75ms. Allocated memory is still 100.7MB. Free memory was 57.8MB in the beginning and 40.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:57:59,259 INFO L158 Benchmark]: TraceAbstraction took 2150.80ms. Allocated memory is still 100.7MB. Free memory was 40.2MB in the beginning and 43.8MB in the end (delta: -3.6MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-07 03:57:59,259 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 100.7MB. Free memory was 43.8MB in the beginning and 43.8MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:57:59,260 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.22ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.49ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 62.7MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.47ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 60.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.69ms. Allocated memory is still 100.7MB. Free memory was 60.5MB in the beginning and 57.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 348.75ms. Allocated memory is still 100.7MB. Free memory was 57.8MB in the beginning and 40.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2150.80ms. Allocated memory is still 100.7MB. Free memory was 40.2MB in the beginning and 43.8MB in the end (delta: -3.6MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 100.7MB. Free memory was 43.8MB in the beginning and 43.8MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_4 = 256; [L24] signed short int var_1_5 = 0; [L25] signed short int var_1_6 = 25; [L26] signed short int var_1_8 = 100; [L27] unsigned char var_1_9 = 1; [L28] signed short int var_1_10 = -4; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 1; [L32] unsigned long int var_1_14 = 64; [L33] double var_1_15 = 10.3; [L34] double var_1_16 = 128.6; [L35] unsigned long int var_1_17 = 2600113953; [L36] float var_1_18 = 8.25; [L37] float var_1_19 = 31.5; [L38] float var_1_20 = 2.625; [L39] float var_1_21 = 999999999999999.2; [L40] float var_1_22 = 127.5; [L41] unsigned char last_1_var_1_9 = 1; VAL [isInitial=0, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_short() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L83] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L84] var_1_5 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L85] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L86] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L86] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=100, var_1_9=1] [L87] var_1_8 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L89] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L90] var_1_10 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_10 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_10 >= -32768) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L92] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L94] var_1_11 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L95] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L97] var_1_12 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L98] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L102] var_1_16 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L104] var_1_17 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L105] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L106] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L107] var_1_19 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L108] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L109] var_1_20 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L110] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L111] var_1_21 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L112] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L113] var_1_22 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L114] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L128] RET updateVariables() [L129] CALL step() [L45] COND TRUE \read(last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=25, var_1_8=0, var_1_9=1] [L46] COND TRUE var_1_5 == var_1_4 [L47] var_1_6 = ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=33/4, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=1] [L54] COND FALSE !(-32 >= (var_1_5 - var_1_8)) [L61] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_4=1, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=1] [L63] COND TRUE var_1_18 > var_1_18 [L64] var_1_1 = ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=6442450943, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=1] [L68] COND TRUE var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16)))) [L69] var_1_14 = (var_1_17 - (var_1_8 + var_1_4)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=6442450942, var_1_17=6442450943, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=1] [L71] COND TRUE ((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5))) [L72] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=6442450942, var_1_17=6442450943, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=1] [L74] COND FALSE !(((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) [L77] var_1_9 = (! var_1_12) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=6442450942, var_1_17=6442450943, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=1] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return ((((((var_1_18 > var_1_18) ? (var_1_1 == ((signed short int) ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2))) : (var_1_1 == ((signed short int) var_1_4))) && (last_1_var_1_9 ? ((var_1_5 == var_1_4) ? (var_1_6 == ((signed short int) ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))))) : (var_1_6 == ((signed short int) var_1_8))) : (var_1_6 == ((signed short int) var_1_4)))) && ((((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) ? (var_1_9 == ((unsigned char) ((! var_1_11) || var_1_12))) : (var_1_9 == ((unsigned char) (! var_1_12))))) && ((((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))) ? (var_1_13 == ((unsigned char) var_1_12)) : 1)) && ((var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16))))) ? (var_1_14 == ((unsigned long int) (var_1_17 - (var_1_8 + var_1_4)))) : 1)) && ((-32 >= (var_1_5 - var_1_8)) ? ((var_1_10 > var_1_6) ? (var_1_18 == ((float) ((var_1_19 - var_1_20) + (var_1_21 + var_1_22)))) : (var_1_18 == ((float) var_1_20))) : (var_1_18 == ((float) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=6442450942, var_1_17=6442450943, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=1] [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=6442450942, var_1_17=6442450943, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=6442450942, var_1_17=6442450943, var_1_18=2, var_1_19=2, var_1_1=-1, var_1_4=1, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 167 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 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 03:57:59,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.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 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:58:00,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:58:01,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 03:58:01,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:58:01,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:58:01,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:58:01,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:58:01,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:58:01,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:58:01,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:58:01,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:58:01,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:58:01,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:58:01,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:58:01,101 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:58:01,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:58:01,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:58:01,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:58:01,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:58:01,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:58:01,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:58:01,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:58:01,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:58:01,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:58:01,104 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:58:01,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:58:01,104 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:58:01,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:58:01,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:58:01,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:58:01,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:58:01,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:58:01,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:58:01,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:58:01,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:58:01,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:58:01,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:58:01,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:58:01,105 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:58:01,105 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:58:01,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:58:01,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:58:01,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:58:01,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:58:01,105 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 -> 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 [2024-11-07 03:58:01,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:58:01,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:58:01,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:58:01,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:58:01,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:58:01,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2024-11-07 03:58:02,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:58:02,699 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:58:02,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2024-11-07 03:58:02,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd28aaf22/e31a5c9e6f974056bc91932838ac4ddf/FLAG830d397b8 [2024-11-07 03:58:02,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd28aaf22/e31a5c9e6f974056bc91932838ac4ddf [2024-11-07 03:58:02,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:58:02,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:58:02,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:58:02,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:58:02,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:58:02,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:02,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568409fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02, skipping insertion in model container [2024-11-07 03:58:02,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:02,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:58:02,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i[919,932] [2024-11-07 03:58:02,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:58:02,934 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:58:02,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i[919,932] [2024-11-07 03:58:02,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:58:02,978 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:58:02,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02 WrapperNode [2024-11-07 03:58:02,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:58:02,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:58:02,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:58:02,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:58:02,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:02,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:03,006 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-07 03:58:03,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:58:03,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:58:03,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:58:03,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:58:03,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:03,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:03,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:03,022 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 03:58:03,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:03,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:03,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:03,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:03,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:03,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:03,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:58:03,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:58:03,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:58:03,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:58:03,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (1/1) ... [2024-11-07 03:58:03,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:58:03,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:58:03,061 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 03:58:03,063 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 03:58:03,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:58:03,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:58:03,078 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:58:03,078 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:58:03,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:58:03,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:58:03,135 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:58:03,137 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:58:05,811 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 03:58:05,811 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:58:05,820 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:58:05,820 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:58:05,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:05 BoogieIcfgContainer [2024-11-07 03:58:05,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:58:05,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:58:05,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:58:05,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:58:05,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:58:02" (1/3) ... [2024-11-07 03:58:05,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340fe93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:05, skipping insertion in model container [2024-11-07 03:58:05,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:02" (2/3) ... [2024-11-07 03:58:05,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340fe93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:05, skipping insertion in model container [2024-11-07 03:58:05,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:05" (3/3) ... [2024-11-07 03:58:05,834 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-54.i [2024-11-07 03:58:05,857 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:58:05,857 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:58:05,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:58:05,900 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;@7aaef622, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:58:05,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:58:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 03:58:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 03:58:05,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:58:05,911 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:58:05,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:58:05,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:58:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1477697952, now seen corresponding path program 1 times [2024-11-07 03:58:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:58:05,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889689318] [2024-11-07 03:58:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:58:05,921 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 03:58:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:58:05,923 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 03:58:05,925 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 03:58:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:06,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 03:58:06,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:58:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-07 03:58:06,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:58:06,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:58:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889689318] [2024-11-07 03:58:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889689318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:58:06,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:58:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:58:06,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596386886] [2024-11-07 03:58:06,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:58:06,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:58:06,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:58:06,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:58:06,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:58:06,259 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 03:58:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:58:06,275 INFO L93 Difference]: Finished difference Result 115 states and 199 transitions. [2024-11-07 03:58:06,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:58:06,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2024-11-07 03:58:06,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:58:06,284 INFO L225 Difference]: With dead ends: 115 [2024-11-07 03:58:06,284 INFO L226 Difference]: Without dead ends: 57 [2024-11-07 03:58:06,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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 03:58:06,289 INFO L432 NwaCegarLoop]: 84 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, 84 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 03:58:06,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:58:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-07 03:58:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-07 03:58:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 03:58:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2024-11-07 03:58:06,323 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 133 [2024-11-07 03:58:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:58:06,323 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2024-11-07 03:58:06,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 03:58:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2024-11-07 03:58:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 03:58:06,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:58:06,325 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:58:06,337 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 03:58:06,527 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 03:58:06,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:58:06,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:58:06,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1677431324, now seen corresponding path program 1 times [2024-11-07 03:58:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:58:06,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787213595] [2024-11-07 03:58:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:58:06,529 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 03:58:06,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:58:06,533 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 03:58:06,534 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 03:58:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:06,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 03:58:06,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:58:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 03:58:07,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:58:07,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:58:07,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787213595] [2024-11-07 03:58:07,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787213595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:58:07,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:58:07,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:58:07,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56837738] [2024-11-07 03:58:07,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:58:07,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:58:07,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:58:07,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:58:07,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:58:07,455 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 03:58:09,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:58:11,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:58:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:58:11,058 INFO L93 Difference]: Finished difference Result 166 states and 247 transitions. [2024-11-07 03:58:11,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:58:11,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 133 [2024-11-07 03:58:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:58:11,085 INFO L225 Difference]: With dead ends: 166 [2024-11-07 03:58:11,085 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 03:58:11,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 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 03:58:11,086 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-07 03:58:11,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 235 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-07 03:58:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 03:58:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2024-11-07 03:58:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-07 03:58:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2024-11-07 03:58:11,117 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 133 [2024-11-07 03:58:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:58:11,117 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2024-11-07 03:58:11,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 03:58:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2024-11-07 03:58:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 03:58:11,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:58:11,118 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:58:11,129 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 03:58:11,319 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 03:58:11,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:58:11,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:58:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash -685244554, now seen corresponding path program 1 times [2024-11-07 03:58:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:58:11,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770336364] [2024-11-07 03:58:11,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:58:11,320 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 03:58:11,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:58:11,322 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 03:58:11,325 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 03:58:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:11,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 03:58:11,591 INFO L278 TraceCheckSpWp]: Computing forward predicates...