./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6a6a77cb8a21263136db7618ce59196f56809d2291fe3be83996eb8e7b3abc4a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:41:08,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:41:08,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:41:08,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:41:08,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:41:08,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:41:08,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:41:08,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:41:08,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:41:08,397 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:41:08,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:41:08,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:41:08,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:41:08,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:41:08,399 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:41:08,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:41:08,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:41:08,400 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:41:08,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:41:08,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:41:08,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:41:08,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:41:08,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:41:08,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:41:08,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:41:08,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:41:08,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:41:08,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:41:08,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:41:08,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:41:08,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:41:08,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:41:08,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:41:08,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:41:08,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:41:08,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:41:08,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:41:08,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:41:08,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:41:08,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:41:08,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:41:08,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:41:08,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 6a6a77cb8a21263136db7618ce59196f56809d2291fe3be83996eb8e7b3abc4a [2024-10-11 10:41:08,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:41:08,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:41:08,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:41:08,702 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:41:08,703 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:41:08,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-1.i [2024-10-11 10:41:10,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:41:10,203 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-11 10:41:10,391 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:41:10,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-1.i [2024-10-11 10:41:10,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e107a45df/e9aa3458da6e47d0945055162993f4cc/FLAGd67fac6b8 [2024-10-11 10:41:10,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e107a45df/e9aa3458da6e47d0945055162993f4cc [2024-10-11 10:41:10,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:41:10,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:41:10,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:41:10,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:41:10,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:41:10,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d7ec8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10, skipping insertion in model container [2024-10-11 10:41:10,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:41:10,639 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-1.i[916,929] [2024-10-11 10:41:10,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:41:10,724 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:41:10,755 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-1.i[916,929] [2024-10-11 10:41:10,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:41:10,795 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:41:10,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10 WrapperNode [2024-10-11 10:41:10,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:41:10,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:41:10,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:41:10,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:41:10,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,836 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-10-11 10:41:10,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:41:10,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:41:10,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:41:10,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:41:10,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,868 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-10-11 10:41:10,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:41:10,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:41:10,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:41:10,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:41:10,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (1/1) ... [2024-10-11 10:41:10,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:41:10,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:41:10,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:41:10,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:41:10,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:41:10,963 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:41:10,963 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:41:10,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:41:10,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:41:10,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:41:11,030 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:41:11,032 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:41:11,295 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 10:41:11,295 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:41:11,323 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:41:11,323 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:41:11,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:11 BoogieIcfgContainer [2024-10-11 10:41:11,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:41:11,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:41:11,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:41:11,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:41:11,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:41:10" (1/3) ... [2024-10-11 10:41:11,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2323ed49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:41:11, skipping insertion in model container [2024-10-11 10:41:11,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:10" (2/3) ... [2024-10-11 10:41:11,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2323ed49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:41:11, skipping insertion in model container [2024-10-11 10:41:11,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:11" (3/3) ... [2024-10-11 10:41:11,335 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-1.i [2024-10-11 10:41:11,356 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:41:11,356 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:41:11,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:41:11,423 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;@557fe6b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:41:11,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:41:11,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 10:41:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 10:41:11,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:11,442 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:41:11,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:11,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash 139227406, now seen corresponding path program 1 times [2024-10-11 10:41:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:41:11,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632303081] [2024-10-11 10:41:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:41:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:41:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:41:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:41:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:41:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:41:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:41:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:41:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:41:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:41:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:41:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:41:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:41:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:41:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:41:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 10:41:11,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:41:11,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632303081] [2024-10-11 10:41:11,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632303081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:41:11,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:41:11,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:41:11,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643707079] [2024-10-11 10:41:11,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:41:11,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:41:11,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:41:11,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:41:11,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:41:11,901 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 10:41:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:41:11,950 INFO L93 Difference]: Finished difference Result 99 states and 164 transitions. [2024-10-11 10:41:11,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:41:11,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-10-11 10:41:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:41:11,963 INFO L225 Difference]: With dead ends: 99 [2024-10-11 10:41:11,964 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 10:41:11,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-10-11 10:41:11,976 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-10-11 10:41:11,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:41:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 10:41:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-11 10:41:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 10:41:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2024-10-11 10:41:12,027 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 92 [2024-10-11 10:41:12,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:41:12,030 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-10-11 10:41:12,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 10:41:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2024-10-11 10:41:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 10:41:12,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:12,038 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:41:12,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:41:12,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:12,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:12,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1732684486, now seen corresponding path program 1 times [2024-10-11 10:41:12,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:41:12,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811226704] [2024-10-11 10:41:12,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:41:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:41:12,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:41:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:41:12,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:41:12,278 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:41:12,282 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:41:12,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:41:12,288 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 10:41:12,384 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:41:12,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:41:12 BoogieIcfgContainer [2024-10-11 10:41:12,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:41:12,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:41:12,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:41:12,393 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:41:12,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:11" (3/4) ... [2024-10-11 10:41:12,397 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:41:12,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:41:12,400 INFO L158 Benchmark]: Toolchain (without parser) took 1975.93ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 126.8MB in the beginning and 163.6MB in the end (delta: -36.8MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-10-11 10:41:12,400 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:41:12,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.89ms. Allocated memory is still 165.7MB. Free memory was 126.5MB in the beginning and 135.3MB in the end (delta: -8.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 10:41:12,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.73ms. Allocated memory is still 165.7MB. Free memory was 134.9MB in the beginning and 132.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:41:12,402 INFO L158 Benchmark]: Boogie Preprocessor took 49.59ms. Allocated memory is still 165.7MB. Free memory was 132.6MB in the beginning and 130.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:41:12,403 INFO L158 Benchmark]: RCFGBuilder took 436.98ms. Allocated memory is still 165.7MB. Free memory was 130.1MB in the beginning and 111.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 10:41:12,403 INFO L158 Benchmark]: TraceAbstraction took 1065.30ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 110.5MB in the beginning and 164.4MB in the end (delta: -53.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:41:12,404 INFO L158 Benchmark]: Witness Printer took 5.40ms. Allocated memory is still 209.7MB. Free memory was 164.4MB in the beginning and 163.6MB in the end (delta: 831.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:41:12,409 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.13ms. Allocated memory is still 165.7MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.89ms. Allocated memory is still 165.7MB. Free memory was 126.5MB in the beginning and 135.3MB in the end (delta: -8.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.73ms. Allocated memory is still 165.7MB. Free memory was 134.9MB in the beginning and 132.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.59ms. Allocated memory is still 165.7MB. Free memory was 132.6MB in the beginning and 130.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.98ms. Allocated memory is still 165.7MB. Free memory was 130.1MB in the beginning and 111.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1065.30ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 110.5MB in the beginning and 164.4MB in the end (delta: -53.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.40ms. Allocated memory is still 209.7MB. Free memory was 164.4MB in the beginning and 163.6MB in the end (delta: 831.2kB). Peak memory consumption was 2.1MB. 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 97, overapproximation of someUnaryFLOAToperation at line 40. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 5.5; [L23] float var_1_2 = 10.375; [L24] float var_1_3 = 127.5; [L25] float var_1_4 = 256.2; [L26] unsigned char var_1_5 = 1; [L27] signed long int var_1_6 = 5; [L28] unsigned char var_1_7 = 1; [L29] signed long int var_1_10 = 32; [L30] signed long int var_1_11 = 2; [L31] unsigned long int var_1_12 = 16; [L32] unsigned char var_1_13 = 50; [L33] signed long int var_1_15 = 100000000; [L34] signed short int var_1_16 = 2; [L35] unsigned long int last_1_var_1_12 = 16; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_12 = var_1_12 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L71] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L72] var_1_3 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L73] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L74] var_1_4 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L75] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L76] var_1_5 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L77] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L78] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=1] [L78] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=1] [L79] var_1_7 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5] [L80] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5] [L81] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L81] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L84] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L84] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L85] var_1_11 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L87] CALL assume_abort_if_not(var_1_11 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L87] RET assume_abort_if_not(var_1_11 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L88] var_1_13 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L90] CALL assume_abort_if_not(var_1_13 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L90] RET assume_abort_if_not(var_1_13 <= 255) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L91] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L91] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=0, var_1_6=5, var_1_7=-255] [L105] RET updateVariables() [L106] CALL step() [L39] COND TRUE var_1_2 <= (- var_1_3) [L40] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=100000005, var_1_4=100000005, var_1_5=0, var_1_6=5, var_1_7=-255] [L48] var_1_16 = var_1_13 [L49] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_12=16, stepLocal_0=-255, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=0, var_1_6=5, var_1_7=-255] [L50] COND TRUE var_1_5 || stepLocal_0 [L51] var_1_6 = ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=0, var_1_6=1, var_1_7=-255] [L55] signed long int stepLocal_3 = var_1_11; [L56] signed long int stepLocal_2 = var_1_16 + var_1_11; VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=0, var_1_6=1, var_1_7=-255] [L57] EXPR var_1_11 << var_1_16 VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=0, var_1_6=1, var_1_7=-255] [L57] signed long int stepLocal_1 = var_1_11 << var_1_16; [L58] COND FALSE !(stepLocal_1 != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=0, var_1_6=1, var_1_7=-255] [L67] var_1_15 = var_1_16 [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (((var_1_2 <= (- var_1_3)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5 ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((var_1_5 || var_1_7) ? (var_1_6 == ((signed long int) ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))))) : (var_1_6 == ((signed long int) ((var_1_10 + var_1_11) - 4))))) && (((var_1_11 << var_1_16) != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) ? (((var_1_16 % var_1_13) >= var_1_11) ? (((var_1_16 + var_1_11) > (last_1_var_1_12 * var_1_16)) ? (var_1_12 == ((unsigned long int) var_1_13)) : (var_1_12 == ((unsigned long int) var_1_10))) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=0, var_1_6=1, var_1_7=-255] [L97-L98] return (((((var_1_2 <= (- var_1_3)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5 ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((var_1_5 || var_1_7) ? (var_1_6 == ((signed long int) ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))))) : (var_1_6 == ((signed long int) ((var_1_10 + var_1_11) - 4))))) && (((var_1_11 << var_1_16) != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) ? (((var_1_16 % var_1_13) >= var_1_11) ? (((var_1_16 + var_1_11) > (last_1_var_1_12 * var_1_16)) ? (var_1_12 == ((unsigned long int) var_1_13)) : (var_1_12 == ((unsigned long int) var_1_10))) : 1) : 1)) && (var_1_15 == ((signed long int) var_1_16))) && (var_1_16 == ((signed short int) var_1_13)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=0, var_1_6=1, var_1_7=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=0, var_1_6=1, var_1_7=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 67 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 91 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 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-10-11 10:41:12,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6a6a77cb8a21263136db7618ce59196f56809d2291fe3be83996eb8e7b3abc4a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:41:14,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:41:14,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:41:14,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:41:14,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:41:14,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:41:14,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:41:14,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:41:14,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:41:14,853 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:41:14,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:41:14,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:41:14,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:41:14,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:41:14,856 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:41:14,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:41:14,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:41:14,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:41:14,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:41:14,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:41:14,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:41:14,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:41:14,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:41:14,859 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:41:14,859 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:41:14,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:41:14,859 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:41:14,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:41:14,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:41:14,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:41:14,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:41:14,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:41:14,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:41:14,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:41:14,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:41:14,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:41:14,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:41:14,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:41:14,868 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:41:14,868 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:41:14,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:41:14,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:41:14,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:41:14,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:41:14,870 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:41:14,870 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 6a6a77cb8a21263136db7618ce59196f56809d2291fe3be83996eb8e7b3abc4a [2024-10-11 10:41:15,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:41:15,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:41:15,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:41:15,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:41:15,263 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:41:15,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-1.i [2024-10-11 10:41:16,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:41:17,113 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:41:17,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-1.i [2024-10-11 10:41:17,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b3efa6449/4e10c71c813c4fc597962d6067f08b9f/FLAG78390b22a [2024-10-11 10:41:17,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b3efa6449/4e10c71c813c4fc597962d6067f08b9f [2024-10-11 10:41:17,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:41:17,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:41:17,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:41:17,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:41:17,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:41:17,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:17,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2040e251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17, skipping insertion in model container [2024-10-11 10:41:17,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:17,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:41:17,721 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-1.i[916,929] [2024-10-11 10:41:17,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:41:17,808 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:41:17,832 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-1.i[916,929] [2024-10-11 10:41:17,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:41:17,890 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:41:17,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17 WrapperNode [2024-10-11 10:41:17,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:41:17,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:41:17,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:41:17,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:41:17,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:17,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:17,949 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-10-11 10:41:17,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:41:17,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:41:17,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:41:17,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:41:17,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:17,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:17,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:17,989 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-10-11 10:41:17,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:17,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:18,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:18,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:18,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:18,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:18,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:41:18,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:41:18,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:41:18,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:41:18,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (1/1) ... [2024-10-11 10:41:18,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:41:18,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:41:18,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:41:18,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:41:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:41:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:41:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:41:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:41:18,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:41:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:41:18,197 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:41:18,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:41:18,560 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:41:18,561 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:41:18,615 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:41:18,616 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:41:18,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:18 BoogieIcfgContainer [2024-10-11 10:41:18,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:41:18,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:41:18,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:41:18,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:41:18,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:41:17" (1/3) ... [2024-10-11 10:41:18,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f126e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:41:18, skipping insertion in model container [2024-10-11 10:41:18,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:17" (2/3) ... [2024-10-11 10:41:18,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f126e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:41:18, skipping insertion in model container [2024-10-11 10:41:18,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:18" (3/3) ... [2024-10-11 10:41:18,631 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-1.i [2024-10-11 10:41:18,648 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:41:18,648 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:41:18,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:41:18,728 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;@5af11a8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:41:18,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:41:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 10:41:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 10:41:18,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:18,743 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:41:18,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:18,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash -484585255, now seen corresponding path program 1 times [2024-10-11 10:41:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:41:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162648643] [2024-10-11 10:41:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:18,765 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-10-11 10:41:18,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:41:18,769 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 10:41:18,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:41:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:18,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:41:18,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:41:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-11 10:41:19,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:41:19,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:41:19,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162648643] [2024-10-11 10:41:19,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162648643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:41:19,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:41:19,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:41:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051232303] [2024-10-11 10:41:19,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:41:19,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:41:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:41:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:41:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:41:19,087 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 10:41:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:41:19,158 INFO L93 Difference]: Finished difference Result 83 states and 142 transitions. [2024-10-11 10:41:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:41:19,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-11 10:41:19,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:41:19,177 INFO L225 Difference]: With dead ends: 83 [2024-10-11 10:41:19,178 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 10:41:19,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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-10-11 10:41:19,187 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:41:19,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:41:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 10:41:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 10:41:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 10:41:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-11 10:41:19,239 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 88 [2024-10-11 10:41:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:41:19,240 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-11 10:41:19,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 10:41:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-11 10:41:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 10:41:19,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:19,246 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 10:41:19,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:41:19,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 10:41:19,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:19,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:19,448 INFO L85 PathProgramCache]: Analyzing trace with hash -605444463, now seen corresponding path program 1 times [2024-10-11 10:41:19,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:41:19,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699120857] [2024-10-11 10:41:19,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:19,449 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-10-11 10:41:19,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:41:19,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 10:41:19,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:41:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:19,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 10:41:19,686 INFO L278 TraceCheckSpWp]: Computing forward predicates...