./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-93.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 5cffec752d7227a7c562d34741b774370eecd95bc2cbcd3f61eafcd9579c5c4e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:52:58,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:52:59,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:52:59,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:52:59,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:52:59,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:52:59,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:52:59,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:52:59,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:52:59,058 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:52:59,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:52:59,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:52:59,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:52:59,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:52:59,064 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:52:59,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:52:59,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:52:59,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:52:59,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:52:59,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:52:59,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:52:59,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:52:59,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:52:59,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:52:59,071 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:52:59,072 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:52:59,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:52:59,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:52:59,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:52:59,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:52:59,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:52:59,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:52:59,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:52:59,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:52:59,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:52:59,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:52:59,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:52:59,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:52:59,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:52:59,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:52:59,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:52:59,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:52:59,079 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/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/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 -> 5cffec752d7227a7c562d34741b774370eecd95bc2cbcd3f61eafcd9579c5c4e [2024-11-10 09:52:59,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:52:59,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:52:59,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:52:59,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:52:59,390 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:52:59,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-93.i [2024-11-10 09:53:00,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:53:00,925 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-11-10 09:53:01,099 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:53:01,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-93.i [2024-11-10 09:53:01,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad3b36eb/4c53159942ca4387a5d30af641e75c92/FLAG16159da98 [2024-11-10 09:53:01,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad3b36eb/4c53159942ca4387a5d30af641e75c92 [2024-11-10 09:53:01,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:53:01,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:53:01,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:53:01,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:53:01,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:53:01,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2887b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01, skipping insertion in model container [2024-11-10 09:53:01,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:53:01,313 WARN L250 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_variablewrapping_wrapper-s_file-93.i[916,929] [2024-11-10 09:53:01,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:53:01,375 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:53:01,387 WARN L250 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_variablewrapping_wrapper-s_file-93.i[916,929] [2024-11-10 09:53:01,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:53:01,457 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:53:01,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01 WrapperNode [2024-11-10 09:53:01,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:53:01,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:53:01,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:53:01,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:53:01,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,525 INFO L138 Inliner]: procedures = 30, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 555 [2024-11-10 09:53:01,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:53:01,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:53:01,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:53:01,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:53:01,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,551 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 09:53:01,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,572 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:53:01,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:53:01,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:53:01,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:53:01,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:53:01,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:53:01,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:53:01,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:53:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:53:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 09:53:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 09:53:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 09:53:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 09:53:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 09:53:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 09:53:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:53:01,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:53:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 09:53:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:53:01,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:53:01,822 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:53:01,824 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:53:02,355 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite118#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~ite116#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~mem126#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite130#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite156#1;havoc property_#t~mem137#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~mem145#1;havoc property_#t~ite152#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite150#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~ite155#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short157#1; [2024-11-10 09:53:02,415 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2024-11-10 09:53:02,416 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:53:02,434 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:53:02,434 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:53:02,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:53:02 BoogieIcfgContainer [2024-11-10 09:53:02,435 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:53:02,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:53:02,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:53:02,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:53:02,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:53:01" (1/3) ... [2024-11-10 09:53:02,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125d4a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:53:02, skipping insertion in model container [2024-11-10 09:53:02,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (2/3) ... [2024-11-10 09:53:02,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125d4a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:53:02, skipping insertion in model container [2024-11-10 09:53:02,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:53:02" (3/3) ... [2024-11-10 09:53:02,448 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-93.i [2024-11-10 09:53:02,464 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:53:02,465 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:53:02,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:53:02,543 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;@bceba93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:53:02,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:53:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 106 states have internal predecessors, (152), 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-11-10 09:53:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:53:02,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:02,565 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:02,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:02,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash -671648358, now seen corresponding path program 1 times [2024-11-10 09:53:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:02,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369717792] [2024-11-10 09:53:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:53:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 09:53:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:53:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:53:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:53:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:53:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:53:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:53:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:53:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:53:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:53:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:53:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:53:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:02,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:53:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:53:03,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:03,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369717792] [2024-11-10 09:53:03,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369717792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:03,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:03,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:53:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208722312] [2024-11-10 09:53:03,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:03,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:53:03,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:03,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:53:03,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:53:03,042 INFO L87 Difference]: Start difference. First operand has 122 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 106 states have internal predecessors, (152), 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 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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-11-10 09:53:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:03,080 INFO L93 Difference]: Finished difference Result 236 states and 367 transitions. [2024-11-10 09:53:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:53:03,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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 128 [2024-11-10 09:53:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:03,092 INFO L225 Difference]: With dead ends: 236 [2024-11-10 09:53:03,092 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 09:53:03,097 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-11-10 09:53:03,102 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:03,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:53:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 09:53:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-10 09:53:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 101 states have internal predecessors, (144), 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-11-10 09:53:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2024-11-10 09:53:03,145 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 128 [2024-11-10 09:53:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:03,146 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2024-11-10 09:53:03,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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-11-10 09:53:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2024-11-10 09:53:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:53:03,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:03,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:03,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:53:03,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:03,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash -410800108, now seen corresponding path program 1 times [2024-11-10 09:53:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:03,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611507362] [2024-11-10 09:53:03,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:03,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:53:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 09:53:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:53:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:53:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:53:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:53:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:53:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:53:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:53:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:53:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:53:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:53:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:53:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:53:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:53:03,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:03,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611507362] [2024-11-10 09:53:03,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611507362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:03,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:03,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:53:03,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293616305] [2024-11-10 09:53:03,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:03,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:53:03,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:03,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:53:03,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:53:03,549 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:53:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:03,608 INFO L93 Difference]: Finished difference Result 233 states and 344 transitions. [2024-11-10 09:53:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:53:03,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-10 09:53:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:03,610 INFO L225 Difference]: With dead ends: 233 [2024-11-10 09:53:03,612 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 09:53:03,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:53:03,615 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:03,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:53:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 09:53:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-10 09:53:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 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-11-10 09:53:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2024-11-10 09:53:03,634 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 128 [2024-11-10 09:53:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:03,636 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2024-11-10 09:53:03,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:53:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2024-11-10 09:53:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:53:03,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:03,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:03,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:53:03,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:03,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:03,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1487353517, now seen corresponding path program 1 times [2024-11-10 09:53:03,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:03,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10525512] [2024-11-10 09:53:03,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:03,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:53:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 09:53:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:53:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:53:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:53:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:53:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:53:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:53:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:53:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:53:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:53:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:53:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:53:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:53:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:53:03,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:03,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10525512] [2024-11-10 09:53:03,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10525512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:03,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:03,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:53:03,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768607599] [2024-11-10 09:53:03,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:03,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:53:03,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:03,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:53:03,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:53:03,929 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:53:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:03,972 INFO L93 Difference]: Finished difference Result 237 states and 348 transitions. [2024-11-10 09:53:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:53:03,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-10 09:53:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:03,975 INFO L225 Difference]: With dead ends: 237 [2024-11-10 09:53:03,977 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 09:53:03,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:53:03,979 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:03,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:53:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 09:53:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-10 09:53:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 105 states have internal predecessors, (148), 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-11-10 09:53:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2024-11-10 09:53:03,998 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 128 [2024-11-10 09:53:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:03,999 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2024-11-10 09:53:04,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:53:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2024-11-10 09:53:04,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:53:04,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:04,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:04,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:53:04,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:04,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:04,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1930964940, now seen corresponding path program 1 times [2024-11-10 09:53:04,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:04,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160611946] [2024-11-10 09:53:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:53:04,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:53:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:53:04,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:53:04,275 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:53:04,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:53:04,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:53:04,281 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 09:53:04,352 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:53:04,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:53:04 BoogieIcfgContainer [2024-11-10 09:53:04,357 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:53:04,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:53:04,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:53:04,358 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:53:04,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:53:02" (3/4) ... [2024-11-10 09:53:04,361 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:53:04,362 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:53:04,365 INFO L158 Benchmark]: Toolchain (without parser) took 3237.78ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 124.3MB in the beginning and 152.6MB in the end (delta: -28.3MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-11-10 09:53:04,366 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:53:04,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.95ms. Allocated memory is still 182.5MB. Free memory was 123.7MB in the beginning and 106.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 09:53:04,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.11ms. Allocated memory is still 182.5MB. Free memory was 106.3MB in the beginning and 102.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:53:04,368 INFO L158 Benchmark]: Boogie Preprocessor took 56.97ms. Allocated memory is still 182.5MB. Free memory was 102.2MB in the beginning and 98.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:53:04,369 INFO L158 Benchmark]: IcfgBuilder took 850.54ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 98.5MB in the beginning and 206.4MB in the end (delta: -107.9MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2024-11-10 09:53:04,369 INFO L158 Benchmark]: TraceAbstraction took 1918.25ms. Allocated memory is still 249.6MB. Free memory was 206.4MB in the beginning and 152.6MB in the end (delta: 53.8MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2024-11-10 09:53:04,369 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 249.6MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:53:04,373 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.15ms. Allocated memory is still 182.5MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.95ms. Allocated memory is still 182.5MB. Free memory was 123.7MB in the beginning and 106.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.11ms. Allocated memory is still 182.5MB. Free memory was 106.3MB in the beginning and 102.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.97ms. Allocated memory is still 182.5MB. Free memory was 102.2MB in the beginning and 98.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 850.54ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 98.5MB in the beginning and 206.4MB in the end (delta: -107.9MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1918.25ms. Allocated memory is still 249.6MB. Free memory was 206.4MB in the beginning and 152.6MB in the end (delta: 53.8MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 249.6MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 255.3, -0.9, 128.5, 9.186, 31.75, 9.6, 499.2, 1.5, 0, 1, 0, 1 }; [L51] float last_1_WrapperStruct00_var_1_10 = 1.5; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_10=3/2] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] EXPR WrapperStruct00.var_1_10 [L103] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L78] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L79] EXPR WrapperStruct00.var_1_3 [L79] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L79] EXPR WrapperStruct00.var_1_3 [L79] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L79] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L79] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L79] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L80] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_3 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_3 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L81] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L82] EXPR WrapperStruct00.var_1_5 [L82] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L82] EXPR WrapperStruct00.var_1_5 [L82] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L82] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L82] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L82] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L83] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_5 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_5 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L84] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L85] EXPR WrapperStruct00.var_1_6 [L85] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L85] EXPR WrapperStruct00.var_1_6 [L85] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L85] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L85] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L85] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L86] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L87] EXPR WrapperStruct00.var_1_7 [L87] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L87] EXPR WrapperStruct00.var_1_7 [L87] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L87] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L87] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L87] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L88] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct00.var_1_8 [L89] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_8 [L89] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L89] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L90] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L91] EXPR WrapperStruct00.var_1_9 [L91] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_9 [L91] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L91] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L92] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L94] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L95] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L97] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L98] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L100] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L114] RET updateVariables() [L115] CALL step() [L55] EXPR WrapperStruct00.var_1_3 [L55] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L55] COND FALSE !(((- last_1_WrapperStruct00_var_1_10) / WrapperStruct00.var_1_3) != (last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5)) [L62] WrapperStruct00.var_1_1 = 64.51f VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L64] EXPR WrapperStruct00.var_1_1 [L64] EXPR WrapperStruct00.var_1_9 [L64] EXPR WrapperStruct00.var_1_5 [L64] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L64] EXPR (((WrapperStruct00.var_1_9 * 128.4)) > ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1))) ? ((WrapperStruct00.var_1_9 * 128.4)) : ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1)) [L64] EXPR WrapperStruct00.var_1_9 [L64] EXPR (((WrapperStruct00.var_1_9 * 128.4)) > ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1))) ? ((WrapperStruct00.var_1_9 * 128.4)) : ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L64] COND TRUE WrapperStruct00.var_1_1 > (((((WrapperStruct00.var_1_9 * 128.4)) > ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1))) ? ((WrapperStruct00.var_1_9 * 128.4)) : ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1)))) [L65] WrapperStruct00.var_1_10 = 1.00000000000004E13f VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L69] EXPR WrapperStruct00.var_1_3 [L69] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L69] COND TRUE ! (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_10) [L70] EXPR WrapperStruct00.var_1_12 [L70] EXPR WrapperStruct00.var_1_12 && WrapperStruct00.var_1_13 [L70] EXPR WrapperStruct00.var_1_13 [L70] EXPR WrapperStruct00.var_1_12 && WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L70] WrapperStruct00.var_1_11 = (WrapperStruct00.var_1_12 && WrapperStruct00.var_1_13) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L106] EXPR (((- last_1_WrapperStruct00_var_1_10) / WrapperStruct00.var_1_3) != (last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5)) ? ((last_1_WrapperStruct00_var_1_10 != (((((WrapperStruct00.var_1_6) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_7))) - WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_9)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((float) 64.51f)) [L106] EXPR WrapperStruct00.var_1_1 [L106] EXPR (((- last_1_WrapperStruct00_var_1_10) / WrapperStruct00.var_1_3) != (last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5)) ? ((last_1_WrapperStruct00_var_1_10 != (((((WrapperStruct00.var_1_6) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_7))) - WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_9)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((float) 64.51f)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L106] EXPR ((((- last_1_WrapperStruct00_var_1_10) / WrapperStruct00.var_1_3) != (last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5)) ? ((last_1_WrapperStruct00_var_1_10 != (((((WrapperStruct00.var_1_6) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_7))) - WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_9)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((float) 64.51f))) && ((WrapperStruct00.var_1_1 > (((((WrapperStruct00.var_1_9 * 128.4)) > ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1))) ? ((WrapperStruct00.var_1_9 * 128.4)) : ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1))))) ? (WrapperStruct00.var_1_10 == ((float) 1.00000000000004E13f)) : (WrapperStruct00.var_1_10 == ((float) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L106] EXPR (((((- last_1_WrapperStruct00_var_1_10) / WrapperStruct00.var_1_3) != (last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5)) ? ((last_1_WrapperStruct00_var_1_10 != (((((WrapperStruct00.var_1_6) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_7))) - WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_9)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((float) 64.51f))) && ((WrapperStruct00.var_1_1 > (((((WrapperStruct00.var_1_9 * 128.4)) > ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1))) ? ((WrapperStruct00.var_1_9 * 128.4)) : ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1))))) ? (WrapperStruct00.var_1_10 == ((float) 1.00000000000004E13f)) : (WrapperStruct00.var_1_10 == ((float) WrapperStruct00.var_1_9)))) && ((! (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 && WrapperStruct00.var_1_13))) : (((WrapperStruct00.var_1_7 / WrapperStruct00.var_1_3) < ((((((((WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6)))) < (WrapperStruct00.var_1_5)) ? (((((WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_5)))) ? (WrapperStruct00.var_1_11 == ((unsigned char) WrapperStruct00.var_1_14)) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L106-L107] return (((((- last_1_WrapperStruct00_var_1_10) / WrapperStruct00.var_1_3) != (last_1_WrapperStruct00_var_1_10 / WrapperStruct00.var_1_5)) ? ((last_1_WrapperStruct00_var_1_10 != (((((WrapperStruct00.var_1_6) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_7))) - WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_9)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((float) 64.51f))) && ((WrapperStruct00.var_1_1 > (((((WrapperStruct00.var_1_9 * 128.4)) > ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1))) ? ((WrapperStruct00.var_1_9 * 128.4)) : ((WrapperStruct00.var_1_5 * WrapperStruct00.var_1_1))))) ? (WrapperStruct00.var_1_10 == ((float) 1.00000000000004E13f)) : (WrapperStruct00.var_1_10 == ((float) WrapperStruct00.var_1_9)))) && ((! (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 && WrapperStruct00.var_1_13))) : (((WrapperStruct00.var_1_7 / WrapperStruct00.var_1_3) < ((((((((WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6)))) < (WrapperStruct00.var_1_5)) ? (((((WrapperStruct00.var_1_8) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_5)))) ? (WrapperStruct00.var_1_11 == ((unsigned char) WrapperStruct00.var_1_14)) : 1)) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=3/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 1170 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 658 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 512 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1092/1092 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:53:04,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-93.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 5cffec752d7227a7c562d34741b774370eecd95bc2cbcd3f61eafcd9579c5c4e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:53:06,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:53:06,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:53:06,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:53:06,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:53:06,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:53:06,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:53:06,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:53:06,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:53:06,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:53:06,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:53:06,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:53:06,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:53:06,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:53:06,746 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:53:06,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:53:06,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:53:06,747 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:53:06,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:53:06,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:53:06,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:53:06,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:53:06,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:53:06,753 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:53:06,753 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:53:06,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:53:06,753 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:53:06,754 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:53:06,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:53:06,754 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:53:06,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:53:06,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:53:06,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:53:06,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:53:06,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:53:06,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:53:06,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:53:06,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:53:06,757 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:53:06,758 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:53:06,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:53:06,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:53:06,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:53:06,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:53:06,759 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/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/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 -> 5cffec752d7227a7c562d34741b774370eecd95bc2cbcd3f61eafcd9579c5c4e [2024-11-10 09:53:07,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:53:07,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:53:07,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:53:07,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:53:07,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:53:07,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-93.i [2024-11-10 09:53:08,694 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:53:08,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:53:08,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-93.i [2024-11-10 09:53:08,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92166f4ba/1f1683164d0e4e2db47a6bbcf340a03d/FLAG7aa5c067a [2024-11-10 09:53:08,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92166f4ba/1f1683164d0e4e2db47a6bbcf340a03d [2024-11-10 09:53:08,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:53:08,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:53:08,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:53:08,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:53:08,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:53:08,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:53:08" (1/1) ... [2024-11-10 09:53:08,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a5aba0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:08, skipping insertion in model container [2024-11-10 09:53:08,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:53:08" (1/1) ... [2024-11-10 09:53:09,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:53:09,189 WARN L250 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_variablewrapping_wrapper-s_file-93.i[916,929] [2024-11-10 09:53:09,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:53:09,281 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:53:09,293 WARN L250 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_variablewrapping_wrapper-s_file-93.i[916,929] [2024-11-10 09:53:09,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:53:09,389 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:53:09,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09 WrapperNode [2024-11-10 09:53:09,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:53:09,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:53:09,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:53:09,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:53:09,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,460 INFO L138 Inliner]: procedures = 34, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 554 [2024-11-10 09:53:09,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:53:09,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:53:09,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:53:09,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:53:09,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,506 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-10 09:53:09,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,530 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:53:09,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:53:09,544 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:53:09,544 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:53:09,545 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (1/1) ... [2024-11-10 09:53:09,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:53:09,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:53:09,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:53:09,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:53:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:53:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 09:53:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 09:53:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-10 09:53:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-10 09:53:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 09:53:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 09:53:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:53:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:53:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:53:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:53:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:53:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:53:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:53:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:53:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-10 09:53:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-10 09:53:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:53:09,628 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:53:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-10 09:53:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-10 09:53:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:53:09,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:53:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:53:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:53:09,805 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:53:09,807 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:54:08,612 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite118#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~ite116#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~mem126#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite130#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite156#1;havoc property_#t~mem137#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~mem145#1;havoc property_#t~ite152#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite150#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~ite155#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short157#1; [2024-11-10 09:54:08,660 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2024-11-10 09:54:08,660 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:54:08,675 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:54:08,675 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:54:08,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:54:08 BoogieIcfgContainer [2024-11-10 09:54:08,676 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:54:08,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:54:08,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:54:08,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:54:08,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:53:08" (1/3) ... [2024-11-10 09:54:08,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3c6c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:54:08, skipping insertion in model container [2024-11-10 09:54:08,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:09" (2/3) ... [2024-11-10 09:54:08,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3c6c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:54:08, skipping insertion in model container [2024-11-10 09:54:08,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:54:08" (3/3) ... [2024-11-10 09:54:08,683 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-93.i [2024-11-10 09:54:08,697 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:54:08,698 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:54:08,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:54:08,792 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;@396820a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:54:08,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:54:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 106 states have internal predecessors, (152), 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-11-10 09:54:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:54:08,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:54:08,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:54:08,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:54:08,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:54:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1905208065, now seen corresponding path program 1 times [2024-11-10 09:54:08,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:54:08,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109433253] [2024-11-10 09:54:08,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:54:08,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:54:08,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:54:08,838 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:54:08,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 09:54:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:54:11,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:54:11,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:54:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-10 09:54:12,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:54:12,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:54:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109433253] [2024-11-10 09:54:12,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109433253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:54:12,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:54:12,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:54:12,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392431375] [2024-11-10 09:54:12,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:54:12,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:54:12,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:54:12,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:54:12,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:54:12,063 INFO L87 Difference]: Start difference. First operand has 122 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 106 states have internal predecessors, (152), 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 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:54:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:54:12,096 INFO L93 Difference]: Finished difference Result 236 states and 367 transitions. [2024-11-10 09:54:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:54:12,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-11-10 09:54:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:54:12,106 INFO L225 Difference]: With dead ends: 236 [2024-11-10 09:54:12,106 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 09:54:12,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:54:12,113 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:54:12,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:54:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 09:54:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-10 09:54:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 101 states have internal predecessors, (144), 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-11-10 09:54:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2024-11-10 09:54:12,156 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 128 [2024-11-10 09:54:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:54:12,157 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2024-11-10 09:54:12,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:54:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2024-11-10 09:54:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:54:12,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:54:12,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:54:12,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 09:54:12,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:54:12,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:54:12,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:54:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2128910981, now seen corresponding path program 1 times [2024-11-10 09:54:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:54:12,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396365029] [2024-11-10 09:54:12,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:54:12,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:54:12,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:54:12,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:54:12,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 09:54:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:54:15,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:54:15,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:54:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:54:15,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:54:15,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:54:15,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396365029] [2024-11-10 09:54:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396365029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:54:15,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:54:15,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:54:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523128099] [2024-11-10 09:54:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:54:15,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:54:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:54:15,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:54:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:54:15,865 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:54:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:54:16,450 INFO L93 Difference]: Finished difference Result 233 states and 344 transitions. [2024-11-10 09:54:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:54:16,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2024-11-10 09:54:16,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:54:16,453 INFO L225 Difference]: With dead ends: 233 [2024-11-10 09:54:16,453 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 09:54:16,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:54:16,455 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:54:16,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:54:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 09:54:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-10 09:54:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 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-11-10 09:54:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2024-11-10 09:54:16,476 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 128 [2024-11-10 09:54:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:54:16,479 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2024-11-10 09:54:16,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 09:54:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2024-11-10 09:54:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 09:54:16,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:54:16,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:54:16,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 09:54:16,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:54:16,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:54:16,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:54:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1043777116, now seen corresponding path program 1 times [2024-11-10 09:54:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:54:16,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439669666] [2024-11-10 09:54:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:54:16,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:54:16,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:54:16,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:54:16,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 09:54:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:54:19,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:54:19,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:54:23,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:54:23,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-10 09:54:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-10 09:54:24,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:54:24,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:54:24,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439669666] [2024-11-10 09:54:24,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439669666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:54:24,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:54:24,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:54:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544109133] [2024-11-10 09:54:24,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:54:24,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:54:24,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:54:24,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:54:24,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:54:24,020 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:54:25,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []