./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.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', 'a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.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 a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:32:57,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:32:57,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:32:57,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:32:57,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:32:57,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:32:57,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:32:57,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:32:57,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:32:57,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:32:57,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:32:57,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:32:57,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:32:57,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:32:57,948 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:32:57,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:32:57,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:32:57,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:32:57,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:32:57,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:32:57,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:32:57,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:32:57,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:32:57,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:32:57,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:32:57,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:32:57,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:32:57,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:32:57,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:32:57,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:32:57,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:32:57,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:32:57,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:32:57,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:32:57,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:32:57,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:32:57,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:32:57,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:32:57,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:32:57,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:32:57,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:32:57,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:32:57,952 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 -> a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 [2024-11-07 07:32:58,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:32:58,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:32:58,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:32:58,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:32:58,263 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:32:58,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i [2024-11-07 07:32:59,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:32:59,799 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:32:59,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i [2024-11-07 07:32:59,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0853b6e7/3d3feeca202a45d0b1c3001180d5015a/FLAGa400c0b58 [2024-11-07 07:33:00,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0853b6e7/3d3feeca202a45d0b1c3001180d5015a [2024-11-07 07:33:00,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:33:00,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:33:00,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:33:00,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:33:00,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:33:00,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102f5465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00, skipping insertion in model container [2024-11-07 07:33:00,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:33:00,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i[913,926] [2024-11-07 07:33:00,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:33:00,344 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:33:00,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i[913,926] [2024-11-07 07:33:00,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:33:00,392 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:33:00,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00 WrapperNode [2024-11-07 07:33:00,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:33:00,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:33:00,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:33:00,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:33:00,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,436 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-11-07 07:33:00,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:33:00,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:33:00,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:33:00,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:33:00,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,468 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:33:00,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:33:00,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:33:00,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:33:00,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:33:00,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (1/1) ... [2024-11-07 07:33:00,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:33:00,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:33:00,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:33:00,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:33:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:33:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:33:00,580 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:33:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:33:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:33:00,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:33:00,661 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:33:00,662 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:33:00,972 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 07:33:00,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:33:00,988 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:33:00,990 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:33:00,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:00 BoogieIcfgContainer [2024-11-07 07:33:00,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:33:00,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:33:00,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:33:00,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:33:00,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:33:00" (1/3) ... [2024-11-07 07:33:00,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e216ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:00, skipping insertion in model container [2024-11-07 07:33:01,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:00" (2/3) ... [2024-11-07 07:33:01,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e216ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:01, skipping insertion in model container [2024-11-07 07:33:01,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:00" (3/3) ... [2024-11-07 07:33:01,002 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-95.i [2024-11-07 07:33:01,017 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:33:01,018 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:33:01,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:33:01,100 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;@9a489a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:33:01,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:33:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 07:33:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 07:33:01,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:01,116 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:33:01,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:01,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:01,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1632324354, now seen corresponding path program 1 times [2024-11-07 07:33:01,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:33:01,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922131698] [2024-11-07 07:33:01,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:01,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:33:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:33:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:33:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:33:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:33:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:33:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:33:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:33:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:33:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:33:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:33:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:33:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:33:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:33:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:33:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:33:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:33:01,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:33:01,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922131698] [2024-11-07 07:33:01,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922131698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:33:01,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:33:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:33:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917603538] [2024-11-07 07:33:01,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:33:01,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:33:01,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:33:01,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:33:01,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:33:01,516 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 48 states have internal predecessors, (69), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 07:33:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:33:01,539 INFO L93 Difference]: Finished difference Result 122 states and 205 transitions. [2024-11-07 07:33:01,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:33:01,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-11-07 07:33:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:33:01,546 INFO L225 Difference]: With dead ends: 122 [2024-11-07 07:33:01,546 INFO L226 Difference]: Without dead ends: 60 [2024-11-07 07:33:01,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:33:01,551 INFO L432 NwaCegarLoop]: 89 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, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:33:01,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:33:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-07 07:33:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-07 07:33:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 07:33:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-07 07:33:01,596 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 104 [2024-11-07 07:33:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:33:01,596 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-07 07:33:01,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 07:33:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-07 07:33:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 07:33:01,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:01,603 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:33:01,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:33:01,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:01,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:01,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1138157052, now seen corresponding path program 1 times [2024-11-07 07:33:01,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:33:01,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221218474] [2024-11-07 07:33:01,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:01,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:33:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:33:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 07:33:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 07:33:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 07:33:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 07:33:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:33:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:33:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:33:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:33:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:33:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:33:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:33:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:33:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:33:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:33:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:33:17,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:33:17,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221218474] [2024-11-07 07:33:17,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221218474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:33:17,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:33:17,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 07:33:17,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352706714] [2024-11-07 07:33:17,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:33:17,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:33:17,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:33:17,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:33:17,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:33:17,062 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:33:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:33:17,499 INFO L93 Difference]: Finished difference Result 198 states and 277 transitions. [2024-11-07 07:33:17,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 07:33:17,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-11-07 07:33:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:33:17,503 INFO L225 Difference]: With dead ends: 198 [2024-11-07 07:33:17,503 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 07:33:17,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:33:17,504 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 96 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:33:17,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 448 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:33:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 07:33:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 92. [2024-11-07 07:33:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.375) internal successors, (99), 73 states have internal predecessors, (99), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 07:33:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 133 transitions. [2024-11-07 07:33:17,521 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 133 transitions. Word has length 104 [2024-11-07 07:33:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:33:17,521 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 133 transitions. [2024-11-07 07:33:17,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:33:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 133 transitions. [2024-11-07 07:33:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 07:33:17,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:17,523 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:33:17,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:33:17,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:17,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:17,524 INFO L85 PathProgramCache]: Analyzing trace with hash -458098682, now seen corresponding path program 1 times [2024-11-07 07:33:17,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:33:17,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480187767] [2024-11-07 07:33:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:17,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:33:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:33:17,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672155279] [2024-11-07 07:33:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:17,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:33:17,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:33:17,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:33:17,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 07:33:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:33:17,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:33:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:33:17,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:33:17,890 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:33:17,891 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:33:17,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 07:33:18,092 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 07:33:18,097 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 07:33:18,179 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:33:18,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:33:18 BoogieIcfgContainer [2024-11-07 07:33:18,184 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:33:18,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:33:18,187 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:33:18,187 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:33:18,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:00" (3/4) ... [2024-11-07 07:33:18,190 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:33:18,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:33:18,191 INFO L158 Benchmark]: Toolchain (without parser) took 18033.99ms. Allocated memory was 117.4MB in the beginning and 939.5MB in the end (delta: 822.1MB). Free memory was 92.2MB in the beginning and 833.9MB in the end (delta: -741.7MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2024-11-07 07:33:18,191 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:33:18,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.60ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 78.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:33:18,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.22ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 75.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:33:18,192 INFO L158 Benchmark]: Boogie Preprocessor took 70.27ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 71.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:33:18,192 INFO L158 Benchmark]: RCFGBuilder took 481.49ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 51.2MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:33:18,192 INFO L158 Benchmark]: TraceAbstraction took 17191.97ms. Allocated memory was 117.4MB in the beginning and 939.5MB in the end (delta: 822.1MB). Free memory was 50.5MB in the beginning and 834.1MB in the end (delta: -783.6MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2024-11-07 07:33:18,193 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 939.5MB. Free memory was 834.1MB in the beginning and 833.9MB in the end (delta: 247.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:33:18,194 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.29ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.60ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 78.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.22ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 75.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.27ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 71.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 481.49ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 51.2MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17191.97ms. Allocated memory was 117.4MB in the beginning and 939.5MB in the end (delta: 822.1MB). Free memory was 50.5MB in the beginning and 834.1MB in the end (delta: -783.6MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 939.5MB. Free memory was 834.1MB in the beginning and 833.9MB in the end (delta: 247.7kB). Peak memory consumption was 8.4MB. 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 116, overapproximation of someBinaryFLOATComparisonOperation at line 116. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] double var_1_2 = 32.25; [L24] double var_1_3 = 16.5; [L25] unsigned char var_1_4 = 10; [L26] unsigned char var_1_5 = 100; [L27] unsigned char var_1_6 = 1; [L28] signed char var_1_7 = -5; [L29] unsigned char var_1_8 = 0; [L30] signed char var_1_9 = -10; [L31] signed short int var_1_10 = 64; [L32] unsigned short int var_1_11 = 0; [L33] float var_1_12 = 64.75; [L34] double var_1_13 = 5.4; [L35] float var_1_14 = 5.625; [L36] unsigned long int var_1_15 = 32; [L37] unsigned short int last_1_var_1_11 = 0; [L38] float last_1_var_1_12 = 64.75; [L39] unsigned long int last_1_var_1_15 = 32; VAL [isInitial=0, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_2=129/4, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L111] last_1_var_1_11 = var_1_11 [L112] last_1_var_1_12 = var_1_12 [L113] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_2=129/4, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L123] RET updateLastVariables() [L124] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L86] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L87] var_1_3 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L88] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L89] var_1_4 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L91] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L91] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L92] var_1_5 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_5 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L93] RET assume_abort_if_not(var_1_5 >= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L94] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L94] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L95] var_1_6 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_7=-5, var_1_8=0, var_1_9=-10] [L96] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_7=-5, var_1_8=0, var_1_9=-10] [L97] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L97] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L98] var_1_8 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_9=-10] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_9=-10] [L100] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-10] [L100] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-10] [L101] var_1_9 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_9 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L102] RET assume_abort_if_not(var_1_9 >= -63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L103] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L103] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L104] var_1_13 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L105] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L106] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L106] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L107] var_1_14 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L108] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L124] RET updateVariables() [L125] CALL step() [L43] unsigned long int stepLocal_1 = var_1_6 - last_1_var_1_15; VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, stepLocal_1=31, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L44] EXPR last_1_var_1_11 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, stepLocal_1=31, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L44] COND FALSE !(stepLocal_1 < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) [L49] COND FALSE !((var_1_5 <= var_1_4) && var_1_8) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=1, var_1_9=-63] [L56] COND TRUE (-8 * var_1_11) < var_1_4 [L57] var_1_7 = 1 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L62] COND TRUE 128 >= last_1_var_1_15 [L63] var_1_15 = (var_1_6 + (var_1_4 + var_1_11)) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L67] COND FALSE !(var_1_2 != (var_1_3 / ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L70] COND FALSE !((10.8 + var_1_12) <= (- var_1_12)) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L73] unsigned char stepLocal_0 = var_1_4; VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L74] COND FALSE !(-4 >= stepLocal_0) [L81] var_1_10 = var_1_4 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L125] RET step() [L126] CALL, EXPR property() [L116] EXPR (((((10.8 + var_1_12) <= (- var_1_12)) ? (var_1_1 == ((unsigned char) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + (var_1_5 - var_1_6)))) : 1) && (((var_1_5 <= var_1_4) && var_1_8) ? (var_1_8 ? (var_1_7 == ((signed char) (var_1_6 + ((((5) < (var_1_9)) ? (5) : (var_1_9)))))) : (var_1_7 == ((signed char) ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9)))))) : (((-8 * var_1_11) < var_1_4) ? (var_1_7 == ((signed char) 1)) : (var_1_7 == ((signed char) var_1_9))))) && ((-4 >= var_1_4) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((signed short int) (var_1_7 + var_1_6))) : (var_1_10 == ((signed short int) var_1_5))) : (var_1_10 == ((signed short int) var_1_4)))) && (((var_1_6 - last_1_var_1_15) < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) ? ((last_1_var_1_12 == last_1_var_1_12) ? (var_1_11 == ((unsigned short int) last_1_var_1_15)) : 1) : 1) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L116-L117] return (((((((10.8 + var_1_12) <= (- var_1_12)) ? (var_1_1 == ((unsigned char) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + (var_1_5 - var_1_6)))) : 1) && (((var_1_5 <= var_1_4) && var_1_8) ? (var_1_8 ? (var_1_7 == ((signed char) (var_1_6 + ((((5) < (var_1_9)) ? (5) : (var_1_9)))))) : (var_1_7 == ((signed char) ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9)))))) : (((-8 * var_1_11) < var_1_4) ? (var_1_7 == ((signed char) 1)) : (var_1_7 == ((signed char) var_1_9))))) && ((-4 >= var_1_4) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((signed short int) (var_1_7 + var_1_6))) : (var_1_10 == ((signed short int) var_1_5))) : (var_1_10 == ((signed short int) var_1_4)))) && (((var_1_6 - last_1_var_1_15) < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) ? ((last_1_var_1_12 == last_1_var_1_12) ? (var_1_11 == ((unsigned short int) last_1_var_1_15)) : 1) : 1)) && ((var_1_2 != (var_1_3 / ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (var_1_12 == ((float) var_1_14)) : 1)) && ((128 >= last_1_var_1_15) ? (var_1_15 == ((unsigned long int) (var_1_6 + (var_1_4 + var_1_11)))) : (var_1_15 == ((unsigned long int) var_1_7))) ; [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=-255, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=1, var_1_9=-63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 537 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 345 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 192 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 49 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 840/840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 07:33:18,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.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 a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:33:20,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:33:20,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:33:20,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:33:20,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:33:20,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:33:20,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:33:20,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:33:20,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:33:20,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:33:20,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:33:20,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:33:20,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:33:20,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:33:20,685 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:33:20,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:33:20,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:33:20,686 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:33:20,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:33:20,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:33:20,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:33:20,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:33:20,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:33:20,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:33:20,687 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:33:20,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:33:20,687 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:33:20,687 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:33:20,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:33:20,687 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:33:20,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:33:20,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:33:20,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:33:20,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:33:20,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:33:20,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:33:20,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:33:20,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:33:20,688 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:33:20,688 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:33:20,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:33:20,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:33:20,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:33:20,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:33:20,689 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 -> a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 [2024-11-07 07:33:20,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:33:21,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:33:21,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:33:21,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:33:21,011 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:33:21,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i [2024-11-07 07:33:22,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:33:22,556 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:33:22,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i [2024-11-07 07:33:22,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7faefbbfd/2c4ecf27b7324438a8436fd34b881bdf/FLAG0cc299dce [2024-11-07 07:33:22,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7faefbbfd/2c4ecf27b7324438a8436fd34b881bdf [2024-11-07 07:33:22,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:33:22,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:33:22,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:33:22,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:33:22,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:33:22,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:22,599 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 07:33:22, skipping insertion in model container [2024-11-07 07:33:22,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:22,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:33:22,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i[913,926] [2024-11-07 07:33:22,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:33:22,846 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:33:22,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i[913,926] [2024-11-07 07:33:22,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:33:22,901 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:33:22,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22 WrapperNode [2024-11-07 07:33:22,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:33:22,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:33:22,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:33:22,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:33:22,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:22,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:22,951 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-07 07:33:22,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:33:22,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:33:22,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:33:22,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:33:22,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:22,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:22,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:22,981 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:33:22,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:22,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:22,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:23,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:23,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:23,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:23,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:33:23,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:33:23,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:33:23,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:33:23,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (1/1) ... [2024-11-07 07:33:23,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:33:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:33:23,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:33:23,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:33:23,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:33:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:33:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:33:23,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:33:23,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:33:23,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:33:23,169 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:33:23,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:33:33,382 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-07 07:33:33,383 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:33:33,392 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:33:33,394 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:33:33,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:33 BoogieIcfgContainer [2024-11-07 07:33:33,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:33:33,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:33:33,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:33:33,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:33:33,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:33:22" (1/3) ... [2024-11-07 07:33:33,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1c9f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:33, skipping insertion in model container [2024-11-07 07:33:33,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:22" (2/3) ... [2024-11-07 07:33:33,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1c9f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:33, skipping insertion in model container [2024-11-07 07:33:33,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:33" (3/3) ... [2024-11-07 07:33:33,407 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-95.i [2024-11-07 07:33:33,421 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:33:33,421 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:33:33,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:33:33,524 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;@2d09af82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:33:33,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:33:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 07:33:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 07:33:33,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:33,541 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:33:33,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:33,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:33,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1733124500, now seen corresponding path program 1 times [2024-11-07 07:33:33,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:33:33,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890802084] [2024-11-07 07:33:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:33,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:33:33,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:33:33,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:33:33,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 07:33:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:34,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:33:34,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:33:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-07 07:33:34,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:33:34,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:33:34,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890802084] [2024-11-07 07:33:34,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890802084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:33:34,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:33:34,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:33:34,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59953025] [2024-11-07 07:33:34,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:33:34,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:33:34,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:33:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:33:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:33:34,438 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 07:33:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:33:34,461 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2024-11-07 07:33:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:33:34,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2024-11-07 07:33:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:33:34,469 INFO L225 Difference]: With dead ends: 100 [2024-11-07 07:33:34,469 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 07:33:34,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:33:34,474 INFO L432 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:33:34,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:33:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 07:33:34,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-07 07:33:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 07:33:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2024-11-07 07:33:34,507 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 101 [2024-11-07 07:33:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:33:34,507 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-11-07 07:33:34,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 07:33:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2024-11-07 07:33:34,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 07:33:34,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:34,512 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:33:34,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 07:33:34,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:33:34,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:34,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:34,714 INFO L85 PathProgramCache]: Analyzing trace with hash -614349018, now seen corresponding path program 1 times [2024-11-07 07:33:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:33:34,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336584715] [2024-11-07 07:33:34,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:34,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:33:34,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:33:34,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:33:34,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 07:33:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:35,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 07:33:35,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:33:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:33:40,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:33:40,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:33:40,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336584715] [2024-11-07 07:33:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336584715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:33:40,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:33:40,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:33:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753957340] [2024-11-07 07:33:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:33:40,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:33:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:33:40,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:33:40,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:33:40,508 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:33:44,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:33:49,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:33:53,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:33:58,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:34:02,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:34:06,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:34:11,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:34:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:34:11,136 INFO L93 Difference]: Finished difference Result 141 states and 207 transitions. [2024-11-07 07:34:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:34:11,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-07 07:34:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:34:11,211 INFO L225 Difference]: With dead ends: 141 [2024-11-07 07:34:11,211 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 07:34:11,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:34:11,212 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2024-11-07 07:34:11,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 121 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 7 Unknown, 0 Unchecked, 30.6s Time] [2024-11-07 07:34:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 07:34:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-07 07:34:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 07:34:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-11-07 07:34:11,237 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 101 [2024-11-07 07:34:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:34:11,238 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-11-07 07:34:11,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:34:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-11-07 07:34:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 07:34:11,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:34:11,241 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:34:11,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 07:34:11,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:34:11,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:34:11,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:34:11,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1160658344, now seen corresponding path program 1 times [2024-11-07 07:34:11,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:34:11,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672761777] [2024-11-07 07:34:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:34:11,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:34:11,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:34:11,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:34:11,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 07:34:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:12,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 07:34:12,234 INFO L278 TraceCheckSpWp]: Computing forward predicates...