./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-40.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_loopvsstraightlinecode_50-while_file-40.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', 'a5f64d67f4c69b79dfee625ca03a5205f4ff9e106670f1e5adca586e13e0121a'] 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_loopvsstraightlinecode_50-while_file-40.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 a5f64d67f4c69b79dfee625ca03a5205f4ff9e106670f1e5adca586e13e0121a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:53:32,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:53:32,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:53:32,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:53:32,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:53:32,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:53:32,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:53:32,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:53:32,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:53:32,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:53:32,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:53:32,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:53:32,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:53:32,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:53:32,969 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:53:32,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:53:32,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:53:32,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:53:32,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:53:32,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:53:32,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:53:32,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:53:32,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:53:32,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:53:32,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:53:32,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:53:32,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:53:32,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:53:32,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:53:32,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:53:32,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:53:32,974 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 -> a5f64d67f4c69b79dfee625ca03a5205f4ff9e106670f1e5adca586e13e0121a [2024-11-07 08:53:33,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:53:33,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:53:33,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:53:33,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:53:33,286 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:53:33,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-40.i [2024-11-07 08:53:34,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:53:34,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:53:34,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-40.i [2024-11-07 08:53:34,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fe5d1232/52d25c3c2511452e8de680ad988dc519/FLAGda7df3dea [2024-11-07 08:53:34,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fe5d1232/52d25c3c2511452e8de680ad988dc519 [2024-11-07 08:53:34,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:53:34,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:53:34,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:53:34,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:53:34,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:53:34,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:53:34" (1/1) ... [2024-11-07 08:53:34,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420386ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:34, skipping insertion in model container [2024-11-07 08:53:34,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:53:34" (1/1) ... [2024-11-07 08:53:34,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:53:35,117 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_loopvsstraightlinecode_50-while_file-40.i[915,928] [2024-11-07 08:53:35,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:53:35,204 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:53:35,217 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_loopvsstraightlinecode_50-while_file-40.i[915,928] [2024-11-07 08:53:35,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:53:35,257 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:53:35,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35 WrapperNode [2024-11-07 08:53:35,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:53:35,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:53:35,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:53:35,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:53:35,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,316 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2024-11-07 08:53:35,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:53:35,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:53:35,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:53:35,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:53:35,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,353 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 08:53:35,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:53:35,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:53:35,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:53:35,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:53:35,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (1/1) ... [2024-11-07 08:53:35,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:53:35,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:53:35,419 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 08:53:35,426 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 08:53:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:53:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:53:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:53:35,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:53:35,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:53:35,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:53:35,520 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:53:35,522 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:53:35,779 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 08:53:35,779 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:53:35,792 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:53:35,793 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:53:35,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:53:35 BoogieIcfgContainer [2024-11-07 08:53:35,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:53:35,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:53:35,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:53:35,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:53:35,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:53:34" (1/3) ... [2024-11-07 08:53:35,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8fc3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:53:35, skipping insertion in model container [2024-11-07 08:53:35,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:35" (2/3) ... [2024-11-07 08:53:35,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8fc3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:53:35, skipping insertion in model container [2024-11-07 08:53:35,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:53:35" (3/3) ... [2024-11-07 08:53:35,802 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-40.i [2024-11-07 08:53:35,815 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:53:35,816 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:53:35,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:53:35,897 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;@8806236, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:53:35,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:53:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:53:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 08:53:35,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:35,909 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:35,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:35,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:35,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1284550771, now seen corresponding path program 1 times [2024-11-07 08:53:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:35,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961525253] [2024-11-07 08:53:35,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:35,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:53:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:53:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:53:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:53:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 08:53:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:53:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:53:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:53:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:53:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:53:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:53:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:53:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:53:36,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961525253] [2024-11-07 08:53:36,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961525253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:36,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:36,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:53:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53473733] [2024-11-07 08:53:36,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:36,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:53:36,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:53:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:53:36,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:53:36,273 INFO L87 Difference]: Start difference. First operand has 50 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:36,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:36,296 INFO L93 Difference]: Finished difference Result 93 states and 152 transitions. [2024-11-07 08:53:36,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:53:36,298 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 85 [2024-11-07 08:53:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:36,306 INFO L225 Difference]: With dead ends: 93 [2024-11-07 08:53:36,306 INFO L226 Difference]: Without dead ends: 46 [2024-11-07 08:53:36,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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 08:53:36,313 INFO L432 NwaCegarLoop]: 65 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, 65 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 08:53:36,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:53:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-07 08:53:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-07 08:53:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:53:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-07 08:53:36,352 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 85 [2024-11-07 08:53:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:36,355 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-07 08:53:36,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-07 08:53:36,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 08:53:36,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:36,358 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:36,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:53:36,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:36,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:36,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1365721472, now seen corresponding path program 1 times [2024-11-07 08:53:36,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:36,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554628619] [2024-11-07 08:53:36,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:53:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:53:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:53:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:53:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 08:53:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:53:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:53:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:53:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:53:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:53:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:53:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:53:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:36,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:53:36,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554628619] [2024-11-07 08:53:36,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554628619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:36,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:36,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:53:36,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587743494] [2024-11-07 08:53:36,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:36,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:53:36,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:53:36,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:53:36,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:53:36,719 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:36,742 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2024-11-07 08:53:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:53:36,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-07 08:53:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:36,746 INFO L225 Difference]: With dead ends: 89 [2024-11-07 08:53:36,746 INFO L226 Difference]: Without dead ends: 46 [2024-11-07 08:53:36,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:53:36,747 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:36,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:53:36,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-07 08:53:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-07 08:53:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:53:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-11-07 08:53:36,763 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 86 [2024-11-07 08:53:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:36,764 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-11-07 08:53:36,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-11-07 08:53:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 08:53:36,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:36,768 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:36,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:53:36,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:36,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2119899198, now seen corresponding path program 1 times [2024-11-07 08:53:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:36,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011068474] [2024-11-07 08:53:36,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:53:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:53:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 08:53:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:53:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 08:53:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:53:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 08:53:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:53:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 08:53:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:53:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 08:53:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:53:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:37,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:53:37,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011068474] [2024-11-07 08:53:37,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011068474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:37,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:37,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:53:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787827660] [2024-11-07 08:53:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:37,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:53:37,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:53:37,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:53:37,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:53:37,312 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:37,814 INFO L93 Difference]: Finished difference Result 169 states and 234 transitions. [2024-11-07 08:53:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:53:37,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-07 08:53:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:37,817 INFO L225 Difference]: With dead ends: 169 [2024-11-07 08:53:37,818 INFO L226 Difference]: Without dead ends: 126 [2024-11-07 08:53:37,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:53:37,821 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 118 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:37,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 224 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:53:37,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-07 08:53:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 79. [2024-11-07 08:53:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 56 states have internal predecessors, (68), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:53:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2024-11-07 08:53:37,858 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 86 [2024-11-07 08:53:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:37,859 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2024-11-07 08:53:37,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2024-11-07 08:53:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 08:53:37,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:37,861 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:37,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:53:37,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:37,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:37,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2121746240, now seen corresponding path program 1 times [2024-11-07 08:53:37,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:53:37,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689937635] [2024-11-07 08:53:37,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:37,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:53:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:53:37,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1065582481] [2024-11-07 08:53:37,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:37,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:53:37,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:53:37,971 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 08:53:37,974 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 08:53:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:53:38,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:53:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:53:38,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:53:38,182 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:53:38,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:53:38,203 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 08:53:38,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:53:38,389 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 08:53:38,471 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:53:38,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:53:38 BoogieIcfgContainer [2024-11-07 08:53:38,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:53:38,478 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:53:38,478 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:53:38,478 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:53:38,479 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:53:35" (3/4) ... [2024-11-07 08:53:38,493 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:53:38,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:53:38,495 INFO L158 Benchmark]: Toolchain (without parser) took 3536.82ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 91.0MB in the beginning and 121.0MB in the end (delta: -30.0MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. [2024-11-07 08:53:38,495 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:53:38,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.93ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 77.3MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:53:38,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.06ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 73.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:53:38,496 INFO L158 Benchmark]: Boogie Preprocessor took 59.21ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 67.5MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:53:38,496 INFO L158 Benchmark]: RCFGBuilder took 416.31ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 47.8MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:53:38,496 INFO L158 Benchmark]: TraceAbstraction took 2681.61ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 47.3MB in the beginning and 46.3MB in the end (delta: 954.9kB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-11-07 08:53:38,497 INFO L158 Benchmark]: Witness Printer took 16.06ms. Allocated memory is still 151.0MB. Free memory was 46.3MB in the beginning and 121.0MB in the end (delta: -74.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:53:38,498 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.53ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.93ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 77.3MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.06ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 73.7MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.21ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 67.5MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 416.31ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 47.8MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2681.61ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 47.3MB in the beginning and 46.3MB in the end (delta: 954.9kB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Witness Printer took 16.06ms. Allocated memory is still 151.0MB. Free memory was 46.3MB in the beginning and 121.0MB in the end (delta: -74.7MB). 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 someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] unsigned char last_1_var_1_9 = 1; [L38] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=-200, var_1_8=5, var_1_9=1] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] last_1_var_1_9 = var_1_9 [L103] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=-200, var_1_8=5, var_1_9=1] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L82] var_1_4 = __VERIFIER_nondet_short() [L83] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L83] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L84] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L85] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L86] var_1_8 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_9=1] [L87] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L89] var_1_10 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L92] var_1_11 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L95] var_1_15 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L97] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L98] var_1_20 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L114] RET updateVariables() [L115] CALL step() [L42] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L49] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L51] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L52] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L53] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=0] [L55] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L56] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L59] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L61] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L62] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L65] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L69] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L70] var_1_25 = var_1_20 [L71] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L72] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L73] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L77] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 411 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 208 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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 08:53:38,516 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_loopvsstraightlinecode_50-while_file-40.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 a5f64d67f4c69b79dfee625ca03a5205f4ff9e106670f1e5adca586e13e0121a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:53:40,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:53:40,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:53:40,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:53:40,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:53:40,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:53:40,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:53:40,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:53:40,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:53:40,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:53:40,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:53:40,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:53:40,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:53:40,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:53:40,918 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:53:40,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:53:40,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:53:40,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:53:40,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:53:40,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:53:40,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:53:40,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:53:40,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:53:40,919 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:53:40,919 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:53:40,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:53:40,919 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:53:40,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:53:40,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:53:40,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:53:40,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:53:40,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:53:40,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:53:40,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:53:40,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:53:40,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:53:40,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:53:40,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:53:40,921 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:53:40,921 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:53:40,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:53:40,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:53:40,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:53:40,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:53:40,921 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 -> a5f64d67f4c69b79dfee625ca03a5205f4ff9e106670f1e5adca586e13e0121a [2024-11-07 08:53:41,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:53:41,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:53:41,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:53:41,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:53:41,249 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:53:41,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-40.i [2024-11-07 08:53:42,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:53:42,883 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:53:42,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-40.i [2024-11-07 08:53:42,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05b711047/4439083654854329a7d70e77fac6ba2a/FLAG1d9b1f0ed [2024-11-07 08:53:42,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05b711047/4439083654854329a7d70e77fac6ba2a [2024-11-07 08:53:42,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:53:42,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:53:42,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:53:42,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:53:42,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:53:42,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:53:42" (1/1) ... [2024-11-07 08:53:42,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e2a60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:42, skipping insertion in model container [2024-11-07 08:53:42,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:53:42" (1/1) ... [2024-11-07 08:53:42,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:53:43,090 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_loopvsstraightlinecode_50-while_file-40.i[915,928] [2024-11-07 08:53:43,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:53:43,174 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:53:43,185 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_loopvsstraightlinecode_50-while_file-40.i[915,928] [2024-11-07 08:53:43,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:53:43,245 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:53:43,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43 WrapperNode [2024-11-07 08:53:43,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:53:43,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:53:43,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:53:43,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:53:43,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,297 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-07 08:53:43,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:53:43,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:53:43,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:53:43,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:53:43,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,335 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 08:53:43,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:53:43,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:53:43,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:53:43,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:53:43,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (1/1) ... [2024-11-07 08:53:43,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:53:43,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:53:43,412 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 08:53:43,416 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 08:53:43,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:53:43,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:53:43,440 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:53:43,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:53:43,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:53:43,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:53:43,506 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:53:43,509 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:53:43,919 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 08:53:43,920 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:53:43,928 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:53:43,928 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:53:43,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:53:43 BoogieIcfgContainer [2024-11-07 08:53:43,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:53:43,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:53:43,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:53:43,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:53:43,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:53:42" (1/3) ... [2024-11-07 08:53:43,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3c2fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:53:43, skipping insertion in model container [2024-11-07 08:53:43,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:53:43" (2/3) ... [2024-11-07 08:53:43,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3c2fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:53:43, skipping insertion in model container [2024-11-07 08:53:43,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:53:43" (3/3) ... [2024-11-07 08:53:43,939 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-40.i [2024-11-07 08:53:43,953 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:53:43,953 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:53:44,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:53:44,028 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;@a5b2a91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:53:44,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:53:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:53:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 08:53:44,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:44,040 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:44,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:44,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1284550771, now seen corresponding path program 1 times [2024-11-07 08:53:44,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:53:44,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740400400] [2024-11-07 08:53:44,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:44,057 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 08:53:44,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:53:44,061 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 08:53:44,062 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 08:53:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:44,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:53:44,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-07 08:53:44,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:53:44,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:53:44,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740400400] [2024-11-07 08:53:44,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740400400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:44,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:44,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:53:44,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134855581] [2024-11-07 08:53:44,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:44,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:53:44,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:53:44,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:53:44,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:53:44,361 INFO L87 Difference]: Start difference. First operand has 50 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:44,386 INFO L93 Difference]: Finished difference Result 93 states and 152 transitions. [2024-11-07 08:53:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:53:44,389 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 85 [2024-11-07 08:53:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:44,394 INFO L225 Difference]: With dead ends: 93 [2024-11-07 08:53:44,395 INFO L226 Difference]: Without dead ends: 46 [2024-11-07 08:53:44,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 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 08:53:44,400 INFO L432 NwaCegarLoop]: 65 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, 65 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 08:53:44,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:53:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-07 08:53:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-07 08:53:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:53:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-07 08:53:44,434 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 85 [2024-11-07 08:53:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:44,435 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-07 08:53:44,435 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 08:53:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-07 08:53:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 08:53:44,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:44,437 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:44,448 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 08:53:44,638 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 08:53:44,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:44,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:44,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1365721472, now seen corresponding path program 1 times [2024-11-07 08:53:44,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:53:44,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224351464] [2024-11-07 08:53:44,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:44,641 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 08:53:44,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:53:44,645 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 08:53:44,646 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 08:53:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:44,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 08:53:44,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:44,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:53:44,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:53:44,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224351464] [2024-11-07 08:53:44,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224351464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:44,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:44,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:53:44,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211199102] [2024-11-07 08:53:44,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:44,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:53:44,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:53:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:53:44,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:53:44,936 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:45,087 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2024-11-07 08:53:45,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:53:45,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-07 08:53:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:45,098 INFO L225 Difference]: With dead ends: 89 [2024-11-07 08:53:45,098 INFO L226 Difference]: Without dead ends: 46 [2024-11-07 08:53:45,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:53:45,100 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:45,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:53:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-07 08:53:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-07 08:53:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 08:53:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-11-07 08:53:45,109 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 86 [2024-11-07 08:53:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:45,110 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-11-07 08:53:45,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-11-07 08:53:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 08:53:45,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:45,112 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:45,120 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 08:53:45,313 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 08:53:45,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:45,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2119899198, now seen corresponding path program 1 times [2024-11-07 08:53:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:53:45,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545416456] [2024-11-07 08:53:45,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:45,315 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 08:53:45,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:53:45,319 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 08:53:45,320 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 08:53:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:45,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 08:53:45,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:53:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 08:53:45,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:53:45,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:53:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545416456] [2024-11-07 08:53:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545416456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:53:45,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:53:45,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:53:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84172871] [2024-11-07 08:53:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:53:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:53:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:53:45,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:53:45,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:53:45,797 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:46,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:53:46,817 INFO L93 Difference]: Finished difference Result 190 states and 261 transitions. [2024-11-07 08:53:46,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:53:46,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-07 08:53:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:53:46,821 INFO L225 Difference]: With dead ends: 190 [2024-11-07 08:53:46,821 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 08:53:46,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:53:46,822 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 152 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 08:53:46,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 226 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 08:53:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 08:53:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 88. [2024-11-07 08:53:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 61 states have internal predecessors, (73), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 08:53:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2024-11-07 08:53:46,853 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 86 [2024-11-07 08:53:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:53:46,854 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2024-11-07 08:53:46,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 08:53:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2024-11-07 08:53:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 08:53:46,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:53:46,856 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:46,866 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 (4)] Ended with exit code 0 [2024-11-07 08:53:47,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 08:53:47,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:53:47,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:53:47,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2121746240, now seen corresponding path program 1 times [2024-11-07 08:53:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:53:47,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365095271] [2024-11-07 08:53:47,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:53:47,059 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 08:53:47,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:53:47,065 INFO L229 MonitoredProcess]: Starting monitored process 5 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 08:53:47,067 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 (5)] Waiting until timeout for monitored process [2024-11-07 08:53:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:53:47,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 08:53:47,308 INFO L278 TraceCheckSpWp]: Computing forward predicates...