./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.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_normal_file-89.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', '533f67809c8aca921080ee1565d5b9ec46e83ec47b06ddb6491bd76587f874a7'] 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_normal_file-89.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 533f67809c8aca921080ee1565d5b9ec46e83ec47b06ddb6491bd76587f874a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:15:13,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:15:13,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:15:13,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:15:13,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:15:13,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:15:13,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:15:13,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:15:13,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:15:13,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:15:13,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:15:13,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:15:13,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:15:13,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:15:13,322 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:15:13,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:15:13,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:15:13,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:15:13,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:15:13,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:15:13,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:15:13,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:15:13,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:15:13,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:15:13,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:15:13,323 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:15:13,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:15:13,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:15:13,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:15:13,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:15:13,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:15:13,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:15:13,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:15:13,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:15:13,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:15:13,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:15:13,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:15:13,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:15:13,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:15:13,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:15:13,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:15:13,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:15:13,325 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 -> 533f67809c8aca921080ee1565d5b9ec46e83ec47b06ddb6491bd76587f874a7 [2024-11-07 04:15:13,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:15:13,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:15:13,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:15:13,610 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:15:13,611 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:15:13,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.i [2024-11-07 04:15:14,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:15:15,172 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:15:15,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.i [2024-11-07 04:15:15,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab4c58841/fc89e4c539334c58bc399f530d8f748f/FLAGfaa091ef5 [2024-11-07 04:15:15,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab4c58841/fc89e4c539334c58bc399f530d8f748f [2024-11-07 04:15:15,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:15:15,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:15:15,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:15:15,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:15:15,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:15:15,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534f6c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15, skipping insertion in model container [2024-11-07 04:15:15,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:15:15,378 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_normal_file-89.i[913,926] [2024-11-07 04:15:15,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:15:15,457 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:15:15,470 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_normal_file-89.i[913,926] [2024-11-07 04:15:15,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:15:15,525 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:15:15,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15 WrapperNode [2024-11-07 04:15:15,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:15:15,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:15:15,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:15:15,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:15:15,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,576 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-07 04:15:15,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:15:15,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:15:15,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:15:15,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:15:15,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,609 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:15:15,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:15:15,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:15:15,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:15:15,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:15:15,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (1/1) ... [2024-11-07 04:15:15,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:15:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:15:15,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 04:15:15,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 04:15:15,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:15:15,686 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:15:15,686 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:15:15,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:15:15,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:15:15,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:15:15,768 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:15:15,770 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:15:16,073 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 04:15:16,075 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:15:16,088 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:15:16,091 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:15:16,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:15:16 BoogieIcfgContainer [2024-11-07 04:15:16,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:15:16,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:15:16,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:15:16,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:15:16,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:15:15" (1/3) ... [2024-11-07 04:15:16,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c3a3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:15:16, skipping insertion in model container [2024-11-07 04:15:16,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:15" (2/3) ... [2024-11-07 04:15:16,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c3a3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:15:16, skipping insertion in model container [2024-11-07 04:15:16,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:15:16" (3/3) ... [2024-11-07 04:15:16,102 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-89.i [2024-11-07 04:15:16,115 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:15:16,117 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:15:16,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:15:16,189 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;@55809f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:15:16,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:15:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 04:15:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 04:15:16,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:16,234 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:15:16,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:16,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:16,242 INFO L85 PathProgramCache]: Analyzing trace with hash -851179789, now seen corresponding path program 1 times [2024-11-07 04:15:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:15:16,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82185588] [2024-11-07 04:15:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:16,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:15:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:15:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:15:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:15:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:15:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:15:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:15:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:15:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:15:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:15:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:15:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:15:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:15:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:15:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:15:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:15:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:15:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 04:15:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:15:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 04:15:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:15:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 04:15:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:15:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 04:15:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:15:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 04:15:16,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:15:16,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82185588] [2024-11-07 04:15:16,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82185588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:15:16,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:15:16,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:15:16,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544963367] [2024-11-07 04:15:16,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:15:16,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:15:16,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:15:16,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:15:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:15:16,677 INFO L87 Difference]: Start difference. First operand has 69 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 04:15:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:15:16,704 INFO L93 Difference]: Finished difference Result 131 states and 234 transitions. [2024-11-07 04:15:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:15:16,706 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 148 [2024-11-07 04:15:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:15:16,713 INFO L225 Difference]: With dead ends: 131 [2024-11-07 04:15:16,713 INFO L226 Difference]: Without dead ends: 65 [2024-11-07 04:15:16,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:15:16,718 INFO L432 NwaCegarLoop]: 101 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, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:15:16,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:15:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-07 04:15:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-07 04:15:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 04:15:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 101 transitions. [2024-11-07 04:15:16,756 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 101 transitions. Word has length 148 [2024-11-07 04:15:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:15:16,758 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 101 transitions. [2024-11-07 04:15:16,758 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 04:15:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2024-11-07 04:15:16,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 04:15:16,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:16,761 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:15:16,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:15:16,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:16,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash -777356745, now seen corresponding path program 1 times [2024-11-07 04:15:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:15:16,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749788365] [2024-11-07 04:15:16,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:16,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:15:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:15:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:15:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:15:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:15:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:15:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:15:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:15:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:15:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:15:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:15:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:15:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:15:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:15:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:15:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:15:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:15:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 04:15:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:15:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 04:15:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:15:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 04:15:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:15:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 04:15:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:15:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 04:15:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:15:17,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749788365] [2024-11-07 04:15:17,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749788365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:15:17,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:15:17,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:15:17,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073443651] [2024-11-07 04:15:17,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:15:17,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:15:17,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:15:17,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:15:17,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:15:17,541 INFO L87 Difference]: Start difference. First operand 65 states and 101 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 04:15:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:15:17,592 INFO L93 Difference]: Finished difference Result 188 states and 295 transitions. [2024-11-07 04:15:17,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:15:17,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 148 [2024-11-07 04:15:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:15:17,596 INFO L225 Difference]: With dead ends: 188 [2024-11-07 04:15:17,598 INFO L226 Difference]: Without dead ends: 126 [2024-11-07 04:15:17,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:15:17,600 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 50 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:15:17,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 191 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:15:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-07 04:15:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2024-11-07 04:15:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 04:15:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 191 transitions. [2024-11-07 04:15:17,639 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 191 transitions. Word has length 148 [2024-11-07 04:15:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:15:17,642 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 191 transitions. [2024-11-07 04:15:17,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 04:15:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 191 transitions. [2024-11-07 04:15:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 04:15:17,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:17,644 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:15:17,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:15:17,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:17,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2038228681, now seen corresponding path program 1 times [2024-11-07 04:15:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:15:17,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120981506] [2024-11-07 04:15:17,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:15:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:15:17,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825109059] [2024-11-07 04:15:17,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:17,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:15:17,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:15:17,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:15:17,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 04:15:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:15:18,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:15:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:15:18,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:15:18,146 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:15:18,147 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:15:18,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 04:15:18,348 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 04:15:18,351 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 04:15:18,452 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:15:18,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:15:18 BoogieIcfgContainer [2024-11-07 04:15:18,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:15:18,458 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:15:18,458 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:15:18,459 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:15:18,459 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:15:16" (3/4) ... [2024-11-07 04:15:18,461 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:15:18,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:15:18,463 INFO L158 Benchmark]: Toolchain (without parser) took 3258.68ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.4MB in the beginning and 101.3MB in the end (delta: -9.9MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-11-07 04:15:18,463 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:15:18,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.37ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 77.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:15:18,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.72ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 74.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:15:18,464 INFO L158 Benchmark]: Boogie Preprocessor took 45.62ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 70.9MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:15:18,464 INFO L158 Benchmark]: RCFGBuilder took 466.20ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 52.1MB in the end (delta: 18.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 04:15:18,464 INFO L158 Benchmark]: TraceAbstraction took 2363.93ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 51.5MB in the beginning and 101.4MB in the end (delta: -49.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:15:18,464 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 159.4MB. Free memory was 101.4MB in the beginning and 101.3MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:15:18,467 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.21ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.37ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 77.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.72ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 74.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.62ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 70.9MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 466.20ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 52.1MB in the end (delta: 18.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2363.93ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 51.5MB in the beginning and 101.4MB in the end (delta: -49.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 159.4MB. Free memory was 101.4MB in the beginning and 101.3MB in the end (delta: 37.6kB). 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 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] signed long int var_1_2 = 16; [L24] signed long int var_1_3 = 4; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] signed long int var_1_6 = 256; [L28] signed long int var_1_7 = -1; [L29] unsigned short int var_1_8 = 32; [L30] signed long int var_1_9 = -16; [L31] unsigned short int var_1_10 = 5; [L32] unsigned short int var_1_11 = 128; [L33] unsigned char var_1_12 = 32; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_15 = 0; [L37] double var_1_16 = 63.75; [L38] double var_1_17 = 8.5; [L39] signed short int var_1_18 = -64; VAL [isInitial=0, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=16, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L96] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L97] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L97] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L98] var_1_3 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L99] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L100] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L100] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L101] var_1_4 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L102] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L103] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L103] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L104] var_1_5 = __VERIFIER_nondet_long() [L105] CALL assume_abort_if_not(var_1_5 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L105] RET assume_abort_if_not(var_1_5 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L106] CALL assume_abort_if_not(var_1_5 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L106] RET assume_abort_if_not(var_1_5 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L107] var_1_6 = __VERIFIER_nondet_long() [L108] CALL assume_abort_if_not(var_1_6 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L108] RET assume_abort_if_not(var_1_6 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L109] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L109] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L110] var_1_7 = __VERIFIER_nondet_long() [L111] CALL assume_abort_if_not(var_1_7 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L111] RET assume_abort_if_not(var_1_7 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L112] CALL assume_abort_if_not(var_1_7 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L112] RET assume_abort_if_not(var_1_7 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L113] var_1_9 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L114] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L115] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L116] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L117] var_1_10 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L118] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L119] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L120] var_1_11 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L121] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L122] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L123] var_1_13 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L124] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L125] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L126] var_1_15 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L127] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L128] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L129] var_1_17 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L130] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L143] RET updateVariables() [L144] CALL step() [L43] COND FALSE !(var_1_2 != var_1_3) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L48] COND FALSE !(var_1_6 >= (var_1_5 / var_1_9)) [L55] var_1_8 = var_1_10 VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L57] COND FALSE !(var_1_10 < var_1_1) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L68] COND FALSE !(var_1_12 > (((((var_1_3) < (var_1_8)) ? (var_1_3) : (var_1_8))) + var_1_10)) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L79] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L86] COND TRUE \read(var_1_4) [L87] var_1_16 = 5.2 VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=26/5, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L92] var_1_18 = var_1_12 VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=26/5, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return ((((((var_1_2 != var_1_3) ? (var_1_4 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_5)) ? (-5) : (var_1_5)))) < (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) ? (((((-5) > (var_1_5)) ? (-5) : (var_1_5)))) : (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7)))))))) : 1) : 1) && ((var_1_6 >= (var_1_5 / var_1_9)) ? ((var_1_3 < (var_1_2 * 256)) ? (var_1_8 == ((unsigned short int) ((((var_1_10) < (((((128) < (var_1_11)) ? (128) : (var_1_11))))) ? (var_1_10) : (((((128) < (var_1_11)) ? (128) : (var_1_11)))))))) : (var_1_8 == ((unsigned short int) var_1_11))) : (var_1_8 == ((unsigned short int) var_1_10)))) && ((var_1_10 < var_1_1) ? ((var_1_3 <= (5 - var_1_8)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((var_1_3 == var_1_6) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_12 > (((((var_1_3) < (var_1_8)) ? (var_1_3) : (var_1_8))) + var_1_10)) ? ((! (var_1_8 >= var_1_5)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_4 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_12)) ; VAL [\result=0, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=26/5, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=26/5, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=26/5, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=1, var_1_5=0, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 200 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 592 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2208/2208 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 04:15:18,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.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 533f67809c8aca921080ee1565d5b9ec46e83ec47b06ddb6491bd76587f874a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:15:20,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:15:20,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:15:20,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:15:20,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:15:20,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:15:20,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:15:20,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:15:20,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:15:20,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:15:20,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:15:20,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:15:20,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:15:20,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:15:20,932 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:15:20,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:15:20,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:15:20,933 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:15:20,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:15:20,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:15:20,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:15:20,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:15:20,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:15:20,934 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:15:20,934 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:15:20,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:15:20,934 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:15:20,934 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:15:20,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:15:20,935 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:15:20,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:15:20,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:15:20,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:15:20,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:15:20,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:15:20,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:15:20,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:15:20,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:15:20,936 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:15:20,936 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:15:20,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:15:20,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:15:20,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:15:20,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:15:20,937 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 -> 533f67809c8aca921080ee1565d5b9ec46e83ec47b06ddb6491bd76587f874a7 [2024-11-07 04:15:21,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:15:21,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:15:21,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:15:21,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:15:21,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:15:21,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.i [2024-11-07 04:15:22,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:15:22,944 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:15:22,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-89.i [2024-11-07 04:15:22,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12275e776/2eac32e3e7c2483a8aac4866de2d94f0/FLAG7163de1f2 [2024-11-07 04:15:22,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12275e776/2eac32e3e7c2483a8aac4866de2d94f0 [2024-11-07 04:15:22,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:15:22,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:15:22,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:15:22,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:15:22,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:15:22,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:15:22" (1/1) ... [2024-11-07 04:15:22,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387a3b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:22, skipping insertion in model container [2024-11-07 04:15:22,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:15:22" (1/1) ... [2024-11-07 04:15:22,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:15:23,126 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_normal_file-89.i[913,926] [2024-11-07 04:15:23,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:15:23,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:15:23,193 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_normal_file-89.i[913,926] [2024-11-07 04:15:23,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:15:23,240 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:15:23,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23 WrapperNode [2024-11-07 04:15:23,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:15:23,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:15:23,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:15:23,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:15:23,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,282 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-07 04:15:23,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:15:23,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:15:23,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:15:23,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:15:23,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,306 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:15:23,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:15:23,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:15:23,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:15:23,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:15:23,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (1/1) ... [2024-11-07 04:15:23,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:15:23,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:15:23,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 04:15:23,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 04:15:23,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:15:23,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:15:23,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:15:23,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:15:23,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:15:23,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:15:23,485 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:15:23,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:15:24,058 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 04:15:24,058 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:15:24,067 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:15:24,067 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:15:24,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:15:24 BoogieIcfgContainer [2024-11-07 04:15:24,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:15:24,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:15:24,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:15:24,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:15:24,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:15:22" (1/3) ... [2024-11-07 04:15:24,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f320e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:15:24, skipping insertion in model container [2024-11-07 04:15:24,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:23" (2/3) ... [2024-11-07 04:15:24,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f320e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:15:24, skipping insertion in model container [2024-11-07 04:15:24,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:15:24" (3/3) ... [2024-11-07 04:15:24,078 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-89.i [2024-11-07 04:15:24,091 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:15:24,091 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:15:24,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:15:24,160 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;@121dea38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:15:24,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:15:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 04:15:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 04:15:24,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:24,176 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:15:24,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:24,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash -851179789, now seen corresponding path program 1 times [2024-11-07 04:15:24,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:15:24,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469826719] [2024-11-07 04:15:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:24,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:15:24,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:15:24,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:15:24,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 04:15:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:24,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:15:24,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:15:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-07 04:15:24,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:15:24,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:15:24,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469826719] [2024-11-07 04:15:24,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469826719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:15:24,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:15:24,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:15:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631827262] [2024-11-07 04:15:24,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:15:24,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:15:24,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:15:24,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:15:24,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:15:24,521 INFO L87 Difference]: Start difference. First operand has 69 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 04:15:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:15:24,545 INFO L93 Difference]: Finished difference Result 131 states and 234 transitions. [2024-11-07 04:15:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:15:24,547 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 148 [2024-11-07 04:15:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:15:24,552 INFO L225 Difference]: With dead ends: 131 [2024-11-07 04:15:24,552 INFO L226 Difference]: Without dead ends: 65 [2024-11-07 04:15:24,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:15:24,557 INFO L432 NwaCegarLoop]: 101 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, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:15:24,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:15:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-07 04:15:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-07 04:15:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 04:15:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 101 transitions. [2024-11-07 04:15:24,596 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 101 transitions. Word has length 148 [2024-11-07 04:15:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:15:24,596 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 101 transitions. [2024-11-07 04:15:24,596 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 04:15:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2024-11-07 04:15:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 04:15:24,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:24,599 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:15:24,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 04:15:24,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:15:24,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:24,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash -777356745, now seen corresponding path program 1 times [2024-11-07 04:15:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:15:24,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716732891] [2024-11-07 04:15:24,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:24,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:15:24,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:15:24,804 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:15:24,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 04:15:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 04:15:25,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:15:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 04:15:25,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:15:25,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:15:25,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716732891] [2024-11-07 04:15:25,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716732891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:15:25,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:15:25,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:15:25,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782626981] [2024-11-07 04:15:25,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:15:25,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:15:25,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:15:25,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:15:25,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:15:25,521 INFO L87 Difference]: Start difference. First operand 65 states and 101 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 04:15:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:15:25,665 INFO L93 Difference]: Finished difference Result 187 states and 293 transitions. [2024-11-07 04:15:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:15:25,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 148 [2024-11-07 04:15:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:15:25,668 INFO L225 Difference]: With dead ends: 187 [2024-11-07 04:15:25,668 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 04:15:25,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:15:25,669 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 23 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:15:25,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 189 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:15:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 04:15:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2024-11-07 04:15:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 04:15:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 189 transitions. [2024-11-07 04:15:25,694 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 189 transitions. Word has length 148 [2024-11-07 04:15:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:15:25,695 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 189 transitions. [2024-11-07 04:15:25,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 04:15:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 189 transitions. [2024-11-07 04:15:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 04:15:25,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:25,698 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:15:25,707 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 04:15:25,898 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 04:15:25,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:25,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2038228681, now seen corresponding path program 1 times [2024-11-07 04:15:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:15:25,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590581446] [2024-11-07 04:15:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:25,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:15:25,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:15:25,902 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 04:15:25,903 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 04:15:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:26,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 04:15:26,147 INFO L278 TraceCheckSpWp]: Computing forward predicates...