./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-a_file-41.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 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:09:32,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:09:32,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:09:32,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:09:32,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:09:32,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:09:32,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:09:32,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:09:32,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:09:32,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:09:32,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:09:32,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:09:32,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:09:32,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:09:32,860 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:09:32,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:09:32,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:09:32,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:09:32,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:09:32,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:09:32,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:09:32,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:09:32,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:09:32,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:09:32,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:09:32,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:09:32,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:09:32,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:09:32,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:09:32,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:09:32,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:09:32,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:09:32,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:09:32,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:09:32,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:09:32,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:09:32,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:09:32,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:09:32,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:09:32,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:09:32,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:09:32,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:09:32,874 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 -> 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 [2024-11-12 07:09:33,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:09:33,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:09:33,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:09:33,182 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:09:33,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:09:33,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i [2024-11-12 07:09:34,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:09:34,975 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:09:34,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i [2024-11-12 07:09:34,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e554d431c/73865f2e8edf430d874b9b8544ae503a/FLAGb144240e2 [2024-11-12 07:09:35,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e554d431c/73865f2e8edf430d874b9b8544ae503a [2024-11-12 07:09:35,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:09:35,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:09:35,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:09:35,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:09:35,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:09:35,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603b85e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35, skipping insertion in model container [2024-11-12 07:09:35,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:09:35,226 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-a_file-41.i[916,929] [2024-11-12 07:09:35,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:09:35,308 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:09:35,319 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-a_file-41.i[916,929] [2024-11-12 07:09:35,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:09:35,375 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:09:35,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35 WrapperNode [2024-11-12 07:09:35,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:09:35,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:09:35,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:09:35,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:09:35,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,449 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 406 [2024-11-12 07:09:35,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:09:35,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:09:35,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:09:35,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:09:35,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,526 INFO L175 MemorySlicer]: Split 111 memory accesses to 7 slices as follows [2, 18, 15, 35, 7, 23, 11]. 32 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 2, 4, 1, 2, 1]. The 17 writes are split as follows [0, 2, 2, 6, 2, 2, 3]. [2024-11-12 07:09:35,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:09:35,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:09:35,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:09:35,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:09:35,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (1/1) ... [2024-11-12 07:09:35,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:09:35,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:09:35,646 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-12 07:09:35,651 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-12 07:09:35,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:09:35,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-12 07:09:35,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-12 07:09:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-12 07:09:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-12 07:09:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-12 07:09:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-12 07:09:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-12 07:09:35,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:09:35,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:09:35,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:09:35,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:09:35,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:09:35,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 07:09:35,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-12 07:09:35,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-12 07:09:35,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-12 07:09:35,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-12 07:09:35,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-12 07:09:35,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-12 07:09:35,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-12 07:09:35,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-12 07:09:35,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:09:35,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:09:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:09:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:09:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:09:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 07:09:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-12 07:09:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-12 07:09:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-12 07:09:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-12 07:09:35,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-12 07:09:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-12 07:09:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-12 07:09:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-12 07:09:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:09:35,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:09:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:09:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:09:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:09:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:09:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:09:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 07:09:35,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-12 07:09:35,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:09:35,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:09:35,867 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:09:35,869 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:09:36,328 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-12 07:09:36,329 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:09:36,350 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:09:36,350 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:09:36,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:09:36 BoogieIcfgContainer [2024-11-12 07:09:36,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:09:36,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:09:36,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:09:36,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:09:36,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:09:35" (1/3) ... [2024-11-12 07:09:36,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35038448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:09:36, skipping insertion in model container [2024-11-12 07:09:36,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:35" (2/3) ... [2024-11-12 07:09:36,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35038448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:09:36, skipping insertion in model container [2024-11-12 07:09:36,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:09:36" (3/3) ... [2024-11-12 07:09:36,364 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-41.i [2024-11-12 07:09:36,380 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:09:36,380 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:09:36,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:09:36,474 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;@2c6c7ad0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:09:36,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:09:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 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-12 07:09:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:09:36,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:36,491 INFO L218 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] [2024-11-12 07:09:36,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:36,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:36,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1011275404, now seen corresponding path program 1 times [2024-11-12 07:09:36,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:36,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184093519] [2024-11-12 07:09:36,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:36,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:36,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:36,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,047 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-12 07:09:37,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:37,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184093519] [2024-11-12 07:09:37,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184093519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:37,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:37,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:09:37,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929823716] [2024-11-12 07:09:37,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:37,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:09:37,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:37,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:09:37,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:09:37,093 INFO L87 Difference]: Start difference. First operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-12 07:09:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:37,132 INFO L93 Difference]: Finished difference Result 167 states and 260 transitions. [2024-11-12 07:09:37,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:09:37,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 114 [2024-11-12 07:09:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:37,144 INFO L225 Difference]: With dead ends: 167 [2024-11-12 07:09:37,145 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 07:09:37,151 INFO L434 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-12 07:09:37,157 INFO L435 NwaCegarLoop]: 115 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, 115 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-12 07:09:37,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:09:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 07:09:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 07:09:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 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-12 07:09:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-12 07:09:37,213 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2024-11-12 07:09:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:37,215 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-12 07:09:37,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-12 07:09:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-12 07:09:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:09:37,222 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:37,222 INFO L218 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] [2024-11-12 07:09:37,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:09:37,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:37,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1389079960, now seen corresponding path program 1 times [2024-11-12 07:09:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:37,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234945638] [2024-11-12 07:09:37,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:37,630 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-12 07:09:37,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:37,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234945638] [2024-11-12 07:09:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234945638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:09:37,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293237373] [2024-11-12 07:09:37,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:37,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:09:37,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:37,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:09:37,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:09:37,637 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-12 07:09:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:37,693 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2024-11-12 07:09:37,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:09:37,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 114 [2024-11-12 07:09:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:37,695 INFO L225 Difference]: With dead ends: 162 [2024-11-12 07:09:37,696 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 07:09:37,696 INFO L434 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-12 07:09:37,698 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:37,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:09:37,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 07:09:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-12 07:09:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 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-12 07:09:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-12 07:09:37,713 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 114 [2024-11-12 07:09:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:37,715 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-12 07:09:37,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-12 07:09:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-12 07:09:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:09:37,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:37,719 INFO L218 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] [2024-11-12 07:09:37,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:09:37,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:37,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:37,721 INFO L85 PathProgramCache]: Analyzing trace with hash -709021590, now seen corresponding path program 1 times [2024-11-12 07:09:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:37,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442660125] [2024-11-12 07:09:37,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:37,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,400 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-12 07:09:38,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:38,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442660125] [2024-11-12 07:09:38,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442660125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:38,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:38,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:09:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904645935] [2024-11-12 07:09:38,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:38,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:09:38,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:09:38,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:09:38,405 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-12 07:09:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:38,568 INFO L93 Difference]: Finished difference Result 220 states and 310 transitions. [2024-11-12 07:09:38,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:09:38,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 114 [2024-11-12 07:09:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:38,571 INFO L225 Difference]: With dead ends: 220 [2024-11-12 07:09:38,571 INFO L226 Difference]: Without dead ends: 140 [2024-11-12 07:09:38,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:09:38,573 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 74 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:38,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 590 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:09:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-12 07:09:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-11-12 07:09:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 111 states have internal predecessors, (145), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 07:09:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 193 transitions. [2024-11-12 07:09:38,597 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 193 transitions. Word has length 114 [2024-11-12 07:09:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:38,601 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 193 transitions. [2024-11-12 07:09:38,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-12 07:09:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 193 transitions. [2024-11-12 07:09:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 07:09:38,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:38,604 INFO L218 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] [2024-11-12 07:09:38,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:09:38,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:38,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2072871418, now seen corresponding path program 1 times [2024-11-12 07:09:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:38,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029892892] [2024-11-12 07:09:38,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:38,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:38,865 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-12 07:09:38,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:38,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029892892] [2024-11-12 07:09:38,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029892892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:38,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:38,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:09:38,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815063590] [2024-11-12 07:09:38,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:38,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:09:38,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:38,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:09:38,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:09:38,871 INFO L87 Difference]: Start difference. First operand 137 states and 193 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-12 07:09:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:38,898 INFO L93 Difference]: Finished difference Result 242 states and 341 transitions. [2024-11-12 07:09:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:09:38,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 115 [2024-11-12 07:09:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:38,905 INFO L225 Difference]: With dead ends: 242 [2024-11-12 07:09:38,906 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 07:09:38,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:09:38,911 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:38,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:09:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 07:09:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-12 07:09:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 82 states have internal predecessors, (102), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 07:09:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2024-11-12 07:09:38,932 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 115 [2024-11-12 07:09:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:38,935 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2024-11-12 07:09:38,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-12 07:09:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2024-11-12 07:09:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:09:38,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:38,937 INFO L218 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] [2024-11-12 07:09:38,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:09:38,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:38,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:38,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2015527011, now seen corresponding path program 1 times [2024-11-12 07:09:38,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:38,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184616194] [2024-11-12 07:09:38,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:38,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:09:39,102 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:09:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:09:39,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:09:39,255 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:09:39,256 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:09:39,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:09:39,262 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 07:09:39,380 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:09:39,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:09:39 BoogieIcfgContainer [2024-11-12 07:09:39,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:09:39,387 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:09:39,387 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:09:39,388 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:09:39,388 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:09:36" (3/4) ... [2024-11-12 07:09:39,391 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:09:39,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:09:39,393 INFO L158 Benchmark]: Toolchain (without parser) took 4384.77ms. Allocated memory was 138.4MB in the beginning and 226.5MB in the end (delta: 88.1MB). Free memory was 80.3MB in the beginning and 121.4MB in the end (delta: -41.0MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-11-12 07:09:39,393 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 138.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:09:39,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.41ms. Allocated memory is still 138.4MB. Free memory was 80.0MB in the beginning and 63.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 07:09:39,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.06ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 63.9MB in the beginning and 152.0MB in the end (delta: -88.0MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-12 07:09:39,398 INFO L158 Benchmark]: Boogie Preprocessor took 140.35ms. Allocated memory is still 184.5MB. Free memory was 152.0MB in the beginning and 152.2MB in the end (delta: -205.5kB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-11-12 07:09:39,398 INFO L158 Benchmark]: RCFGBuilder took 759.11ms. Allocated memory is still 184.5MB. Free memory was 152.2MB in the beginning and 119.8MB in the end (delta: 32.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-12 07:09:39,399 INFO L158 Benchmark]: TraceAbstraction took 3030.77ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 118.6MB in the beginning and 122.4MB in the end (delta: -3.8MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-11-12 07:09:39,399 INFO L158 Benchmark]: Witness Printer took 5.10ms. Allocated memory is still 226.5MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:09:39,401 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.18ms. Allocated memory is still 138.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.41ms. Allocated memory is still 138.4MB. Free memory was 80.0MB in the beginning and 63.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.06ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 63.9MB in the beginning and 152.0MB in the end (delta: -88.0MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.35ms. Allocated memory is still 184.5MB. Free memory was 152.0MB in the beginning and 152.2MB in the end (delta: -205.5kB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * RCFGBuilder took 759.11ms. Allocated memory is still 184.5MB. Free memory was 152.2MB in the beginning and 119.8MB in the end (delta: 32.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3030.77ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 118.6MB in the beginning and 122.4MB in the end (delta: -3.8MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 5.10ms. Allocated memory is still 226.5MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryArithmeticDOUBLEoperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 8.5, 999999999999.6 }; [L25-L27] double double_Array_0[2] = { 8.5, 999999999999.6 }; [L25-L27] double double_Array_0[2] = { 8.5, 999999999999.6 }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 10 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 10 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 64 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 2 }; [L40] signed char last_1_signed_char_Array_0_1__1_ = -16; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR signed_char_Array_0[1][1] [L98] last_1_signed_char_Array_0_1__1_ = signed_char_Array_0[1][1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1][0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1][0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L91] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L109] RET updateVariables() [L110] CALL step() [L44] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] COND TRUE BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_) [L45] EXPR unsigned_char_Array_0[1] [L45] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L47] EXPR double_Array_0[1] [L47] double_Array_0[0] = (double_Array_0[1] - 8.3) [L48] EXPR double_Array_0[1] [L48] EXPR double_Array_0[0] [L48] unsigned char stepLocal_1 = double_Array_0[1] >= double_Array_0[0]; [L49] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE BOOL_unsigned_char_Array_0[1] && stepLocal_1 [L50] EXPR unsigned_char_Array_0[0] [L50] signed_long_int_Array_0[0] = unsigned_char_Array_0[0] [L54] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L54] COND TRUE BOOL_unsigned_char_Array_0[1] [L55] EXPR unsigned_char_Array_0[0] [L55] EXPR unsigned_char_Array_0[0] [L55] unsigned_short_int_Array_0[0] = (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]) [L63] EXPR unsigned_short_int_Array_0[0] [L63] EXPR unsigned_char_Array_0[0] [L63] unsigned long int stepLocal_0 = (unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]; [L64] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND FALSE !(stepLocal_0 > unsigned_short_int_Array_0[0]) [L71] EXPR signed_char_Array_0[0][1] [L71] signed_char_Array_0[1][1] = signed_char_Array_0[0][1] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR unsigned_short_int_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) [L101] EXPR signed_char_Array_0[1][1] [L101] EXPR signed_char_Array_0[0][1] [L101] EXPR (((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])))) [L101] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))) [L101] EXPR unsigned_short_int_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3))) [L101] EXPR double_Array_0[0] [L101] EXPR double_Array_0[1] [L101] EXPR (((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])))) && ((BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_)) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])))) && ((BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_)) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101-L102] return (((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])))) && ((BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_)) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 1241 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 738 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 503 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1456/1456 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-12 07:09:39,444 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-a_file-41.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 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:09:41,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:09:41,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:09:41,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:09:41,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:09:41,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:09:41,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:09:41,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:09:41,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:09:41,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:09:41,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:09:41,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:09:41,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:09:41,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:09:41,920 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:09:41,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:09:41,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:09:41,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:09:41,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:09:41,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:09:41,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:09:41,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:09:41,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:09:41,923 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:09:41,924 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:09:41,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:09:41,924 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:09:41,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:09:41,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:09:41,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:09:41,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:09:41,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:09:41,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:09:41,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:09:41,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:09:41,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:09:41,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:09:41,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:09:41,928 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:09:41,928 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:09:41,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:09:41,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:09:41,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:09:41,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:09:41,930 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 -> 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 [2024-11-12 07:09:42,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:09:42,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:09:42,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:09:42,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:09:42,340 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:09:42,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i [2024-11-12 07:09:43,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:09:44,217 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:09:44,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i [2024-11-12 07:09:44,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f931243/b3177e42de284f1f973b645eec17d080/FLAGa4e50f5c1 [2024-11-12 07:09:44,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f931243/b3177e42de284f1f973b645eec17d080 [2024-11-12 07:09:44,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:09:44,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:09:44,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:09:44,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:09:44,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:09:44,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:44,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3bd8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44, skipping insertion in model container [2024-11-12 07:09:44,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:44,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:09:44,810 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-a_file-41.i[916,929] [2024-11-12 07:09:44,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:09:44,892 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:09:44,904 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-a_file-41.i[916,929] [2024-11-12 07:09:44,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:09:44,983 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:09:44,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44 WrapperNode [2024-11-12 07:09:44,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:09:44,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:09:44,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:09:44,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:09:44,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,059 INFO L138 Inliner]: procedures = 36, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2024-11-12 07:09:45,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:09:45,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:09:45,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:09:45,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:09:45,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,134 INFO L175 MemorySlicer]: Split 111 memory accesses to 7 slices as follows [2, 18, 15, 35, 7, 23, 11]. 32 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 2, 4, 1, 2, 1]. The 17 writes are split as follows [0, 2, 2, 6, 2, 2, 3]. [2024-11-12 07:09:45,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:09:45,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:09:45,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:09:45,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:09:45,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (1/1) ... [2024-11-12 07:09:45,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:09:45,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:09:45,223 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-12 07:09:45,227 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-12 07:09:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:09:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:09:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-12 07:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-12 07:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-12 07:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-12 07:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-12 07:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:09:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:09:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-12 07:09:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-12 07:09:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-12 07:09:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-12 07:09:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-12 07:09:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:09:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:09:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 07:09:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-12 07:09:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-12 07:09:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-12 07:09:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-12 07:09:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-12 07:09:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-12 07:09:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-12 07:09:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-12 07:09:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-12 07:09:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-12 07:09:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-12 07:09:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:09:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:09:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 07:09:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-12 07:09:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-12 07:09:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-12 07:09:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-12 07:09:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-12 07:09:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-12 07:09:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:09:45,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:09:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:09:45,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:09:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:09:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:09:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-12 07:09:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-12 07:09:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-12 07:09:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-12 07:09:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-12 07:09:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:09:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:09:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-12 07:09:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-12 07:09:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-12 07:09:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-12 07:09:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-12 07:09:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:09:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:09:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 07:09:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-12 07:09:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-12 07:09:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-12 07:09:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-12 07:09:45,485 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:09:45,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:09:46,459 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-12 07:09:46,459 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:09:46,478 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:09:46,478 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:09:46,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:09:46 BoogieIcfgContainer [2024-11-12 07:09:46,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:09:46,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:09:46,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:09:46,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:09:46,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:09:44" (1/3) ... [2024-11-12 07:09:46,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b51dc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:09:46, skipping insertion in model container [2024-11-12 07:09:46,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:44" (2/3) ... [2024-11-12 07:09:46,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b51dc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:09:46, skipping insertion in model container [2024-11-12 07:09:46,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:09:46" (3/3) ... [2024-11-12 07:09:46,492 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-41.i [2024-11-12 07:09:46,511 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:09:46,512 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:09:46,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:09:46,574 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;@2a0e586, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:09:46,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:09:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 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-12 07:09:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:09:46,595 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:46,596 INFO L218 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] [2024-11-12 07:09:46,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:46,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1011275404, now seen corresponding path program 1 times [2024-11-12 07:09:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:09:46,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993564003] [2024-11-12 07:09:46,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:46,617 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-12 07:09:46,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:09:46,634 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-12 07:09:46,636 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-12 07:09:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:47,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:09:47,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:09:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-12 07:09:47,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:09:47,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:09:47,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993564003] [2024-11-12 07:09:47,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993564003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:47,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:47,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:09:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240009133] [2024-11-12 07:09:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:47,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:09:47,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:09:47,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:09:47,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:09:47,168 INFO L87 Difference]: Start difference. First operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-12 07:09:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:47,203 INFO L93 Difference]: Finished difference Result 167 states and 260 transitions. [2024-11-12 07:09:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:09:47,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 114 [2024-11-12 07:09:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:47,211 INFO L225 Difference]: With dead ends: 167 [2024-11-12 07:09:47,211 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 07:09:47,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-12 07:09:47,217 INFO L435 NwaCegarLoop]: 115 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, 115 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-12 07:09:47,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:09:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 07:09:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 07:09:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 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-12 07:09:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-12 07:09:47,266 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2024-11-12 07:09:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:47,267 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-12 07:09:47,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-12 07:09:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-12 07:09:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:09:47,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:47,273 INFO L218 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] [2024-11-12 07:09:47,288 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-12 07:09:47,475 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-12 07:09:47,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:47,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:47,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1389079960, now seen corresponding path program 1 times [2024-11-12 07:09:47,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:09:47,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274119112] [2024-11-12 07:09:47,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:47,479 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-12 07:09:47,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:09:47,482 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-12 07:09:47,483 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-12 07:09:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:47,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:09:47,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:09:47,936 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-12 07:09:47,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:09:47,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:09:47,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274119112] [2024-11-12 07:09:47,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274119112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:47,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:47,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:09:47,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590617974] [2024-11-12 07:09:47,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:47,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:09:47,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:09:47,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:09:47,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:09:47,944 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-12 07:09:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:48,114 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2024-11-12 07:09:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:09:48,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 114 [2024-11-12 07:09:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:48,117 INFO L225 Difference]: With dead ends: 162 [2024-11-12 07:09:48,117 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 07:09:48,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 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-12 07:09:48,119 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:48,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:09:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 07:09:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-12 07:09:48,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 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-12 07:09:48,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-12 07:09:48,131 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 114 [2024-11-12 07:09:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:48,137 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-12 07:09:48,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-12 07:09:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-12 07:09:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:09:48,139 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:48,139 INFO L218 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] [2024-11-12 07:09:48,150 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-12 07:09:48,340 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-12 07:09:48,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:48,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash -709021590, now seen corresponding path program 1 times [2024-11-12 07:09:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:09:48,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220067219] [2024-11-12 07:09:48,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:48,342 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-12 07:09:48,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:09:48,344 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-12 07:09:48,346 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-12 07:09:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:48,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:09:48,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:09:48,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:09:48,867 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-12 07:09:48,911 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-12 07:09:48,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:09:48,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:09:48,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220067219] [2024-11-12 07:09:48,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220067219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:48,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:48,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:09:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13185368] [2024-11-12 07:09:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:48,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:09:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:09:48,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:09:48,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:09:48,918 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-12 07:09:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:49,482 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2024-11-12 07:09:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:09:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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 114 [2024-11-12 07:09:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:49,484 INFO L225 Difference]: With dead ends: 164 [2024-11-12 07:09:49,485 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 07:09:49,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:09:49,490 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 94 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:49,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 384 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:09:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 07:09:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-12 07:09:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 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-12 07:09:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 116 transitions. [2024-11-12 07:09:49,500 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 116 transitions. Word has length 114 [2024-11-12 07:09:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:49,501 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 116 transitions. [2024-11-12 07:09:49,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-12 07:09:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2024-11-12 07:09:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:09:49,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:49,503 INFO L218 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] [2024-11-12 07:09:49,512 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-12 07:09:49,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-12 07:09:49,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:49,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -400113810, now seen corresponding path program 1 times [2024-11-12 07:09:49,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:09:49,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019197653] [2024-11-12 07:09:49,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:49,707 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-12 07:09:49,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:09:49,709 INFO L229 MonitoredProcess]: Starting monitored process 5 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-12 07:09:49,711 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 (5)] Waiting until timeout for monitored process [2024-11-12 07:09:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:50,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 07:09:50,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:09:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-12 07:09:50,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:09:50,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:09:50,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019197653] [2024-11-12 07:09:50,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019197653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:50,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:50,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:09:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227965722] [2024-11-12 07:09:50,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:50,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:09:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:09:50,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:09:50,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:09:50,128 INFO L87 Difference]: Start difference. First operand 83 states and 116 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-12 07:09:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:50,326 INFO L93 Difference]: Finished difference Result 167 states and 234 transitions. [2024-11-12 07:09:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:09:50,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2024-11-12 07:09:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:50,328 INFO L225 Difference]: With dead ends: 167 [2024-11-12 07:09:50,328 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 07:09:50,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:09:50,330 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:50,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:09:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 07:09:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2024-11-12 07:09:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 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-12 07:09:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2024-11-12 07:09:50,339 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 116 [2024-11-12 07:09:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:50,339 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2024-11-12 07:09:50,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-12 07:09:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2024-11-12 07:09:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:09:50,341 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:50,341 INFO L218 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] [2024-11-12 07:09:50,355 INFO L540 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 (5)] Forceful destruction successful, exit code 0 [2024-11-12 07:09:50,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-12 07:09:50,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:50,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1479017136, now seen corresponding path program 1 times [2024-11-12 07:09:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:09:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110788392] [2024-11-12 07:09:50,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:50,544 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-12 07:09:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:09:50,546 INFO L229 MonitoredProcess]: Starting monitored process 6 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-12 07:09:50,547 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 (6)] Waiting until timeout for monitored process [2024-11-12 07:09:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:50,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 07:09:50,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:09:51,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-12 07:09:51,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2024-11-12 07:09:51,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:09:51,899 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 98 treesize of output 44 [2024-11-12 07:09:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 168 proven. 12 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-12 07:09:51,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:09:52,194 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-12 07:09:52,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:09:52,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110788392] [2024-11-12 07:09:52,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110788392] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:09:52,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:09:52,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2024-11-12 07:09:52,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164069428] [2024-11-12 07:09:52,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:52,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:09:52,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:09:52,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:09:52,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:09:52,201 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-12 07:09:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:52,413 INFO L93 Difference]: Finished difference Result 220 states and 304 transitions. [2024-11-12 07:09:52,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:09:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 116 [2024-11-12 07:09:52,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:52,416 INFO L225 Difference]: With dead ends: 220 [2024-11-12 07:09:52,416 INFO L226 Difference]: Without dead ends: 140 [2024-11-12 07:09:52,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:09:52,418 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 72 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:52,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 576 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:09:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-12 07:09:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-11-12 07:09:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.2818181818181817) internal successors, (141), 111 states have internal predecessors, (141), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 07:09:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions. [2024-11-12 07:09:52,433 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 116 [2024-11-12 07:09:52,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:52,434 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions. [2024-11-12 07:09:52,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-12 07:09:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions. [2024-11-12 07:09:52,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-12 07:09:52,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:52,436 INFO L218 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] [2024-11-12 07:09:52,449 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 (6)] Ended with exit code 0 [2024-11-12 07:09:52,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-12 07:09:52,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:52,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:52,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1182595188, now seen corresponding path program 1 times [2024-11-12 07:09:52,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:09:52,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397894752] [2024-11-12 07:09:52,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:52,638 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-12 07:09:52,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:09:52,642 INFO L229 MonitoredProcess]: Starting monitored process 7 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-12 07:09:52,643 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 (7)] Waiting until timeout for monitored process [2024-11-12 07:09:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:52,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 07:09:52,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:09:52,943 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-12 07:09:52,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:09:52,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:09:52,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397894752] [2024-11-12 07:09:52,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397894752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:52,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:52,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:09:52,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975398611] [2024-11-12 07:09:52,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:52,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:09:52,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:09:52,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:09:52,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:09:52,947 INFO L87 Difference]: Start difference. First operand 137 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-12 07:09:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:52,978 INFO L93 Difference]: Finished difference Result 242 states and 333 transitions. [2024-11-12 07:09:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:09:52,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 117 [2024-11-12 07:09:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:52,983 INFO L225 Difference]: With dead ends: 242 [2024-11-12 07:09:52,983 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 07:09:52,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:09:52,984 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:52,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:09:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 07:09:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-12 07:09:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 82 states have internal predecessors, (98), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 07:09:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2024-11-12 07:09:53,003 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 117 [2024-11-12 07:09:53,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:53,003 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2024-11-12 07:09:53,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-12 07:09:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2024-11-12 07:09:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 07:09:53,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:53,008 INFO L218 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] [2024-11-12 07:09:53,022 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 (7)] Ended with exit code 0 [2024-11-12 07:09:53,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-12 07:09:53,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:53,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:53,210 INFO L85 PathProgramCache]: Analyzing trace with hash 186767657, now seen corresponding path program 1 times [2024-11-12 07:09:53,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:09:53,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091325332] [2024-11-12 07:09:53,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:53,211 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-12 07:09:53,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:09:53,213 INFO L229 MonitoredProcess]: Starting monitored process 8 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-12 07:09:53,214 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 (8)] Waiting until timeout for monitored process [2024-11-12 07:10:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:10:14,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 07:10:14,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:10:14,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:10:17,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 101 [2024-11-12 07:10:32,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:10:32,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 394 treesize of output 144 [2024-11-12 07:10:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 27 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-12 07:10:34,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:10:43,946 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-12 07:10:43,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:10:43,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091325332] [2024-11-12 07:10:43,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091325332] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:10:43,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:10:43,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2024-11-12 07:10:43,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651862834] [2024-11-12 07:10:43,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:10:43,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:10:43,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:10:43,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:10:43,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:10:43,949 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-12 07:10:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:10:51,122 INFO L93 Difference]: Finished difference Result 235 states and 316 transitions. [2024-11-12 07:10:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:10:51,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 118 [2024-11-12 07:10:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:10:51,141 INFO L225 Difference]: With dead ends: 235 [2024-11-12 07:10:51,141 INFO L226 Difference]: Without dead ends: 156 [2024-11-12 07:10:51,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:10:51,143 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 51 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:10:51,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 527 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-12 07:10:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-12 07:10:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2024-11-12 07:10:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.2479338842975207) internal successors, (151), 123 states have internal predecessors, (151), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 07:10:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 207 transitions. [2024-11-12 07:10:51,166 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 207 transitions. Word has length 118 [2024-11-12 07:10:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:10:51,167 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 207 transitions. [2024-11-12 07:10:51,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-12 07:10:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 207 transitions. [2024-11-12 07:10:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 07:10:51,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:10:51,169 INFO L218 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] [2024-11-12 07:10:51,193 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 (8)] Ended with exit code 0 [2024-11-12 07:10:51,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-12 07:10:51,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:10:51,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:10:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash 866826027, now seen corresponding path program 1 times [2024-11-12 07:10:51,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:10:51,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012302121] [2024-11-12 07:10:51,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:10:51,371 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-12 07:10:51,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:10:51,372 INFO L229 MonitoredProcess]: Starting monitored process 9 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-12 07:10:51,374 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 (9)] Waiting until timeout for monitored process [2024-11-12 07:10:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:10:51,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:10:51,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:10:51,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-12 07:10:51,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2024-11-12 07:10:51,749 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-12 07:10:51,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:10:51,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:10:51,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012302121] [2024-11-12 07:10:51,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012302121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:10:51,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:10:51,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:10:51,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317592576] [2024-11-12 07:10:51,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:10:51,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:10:51,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:10:51,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:10:51,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:10:51,752 INFO L87 Difference]: Start difference. First operand 153 states and 207 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-12 07:10:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:10:52,229 INFO L93 Difference]: Finished difference Result 407 states and 549 transitions. [2024-11-12 07:10:52,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:10:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 118 [2024-11-12 07:10:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:10:52,233 INFO L225 Difference]: With dead ends: 407 [2024-11-12 07:10:52,233 INFO L226 Difference]: Without dead ends: 283 [2024-11-12 07:10:52,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:10:52,235 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 95 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:10:52,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 693 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:10:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-12 07:10:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2024-11-12 07:10:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 215 states have (on average 1.2372093023255815) internal successors, (266), 219 states have internal predecessors, (266), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 07:10:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 358 transitions. [2024-11-12 07:10:52,274 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 358 transitions. Word has length 118 [2024-11-12 07:10:52,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:10:52,275 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 358 transitions. [2024-11-12 07:10:52,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-12 07:10:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 358 transitions. [2024-11-12 07:10:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 07:10:52,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:10:52,277 INFO L218 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] [2024-11-12 07:10:52,291 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 (9)] Ended with exit code 0 [2024-11-12 07:10:52,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-12 07:10:52,479 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:10:52,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:10:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash 609469483, now seen corresponding path program 1 times [2024-11-12 07:10:52,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:10:52,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424074964] [2024-11-12 07:10:52,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:10:52,482 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-12 07:10:52,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:10:52,485 INFO L229 MonitoredProcess]: Starting monitored process 10 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-12 07:10:52,488 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 (10)] Waiting until timeout for monitored process [2024-11-12 07:10:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:10:53,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 07:10:53,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:10:53,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:10:57,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:10:57,491 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 321 treesize of output 141 [2024-11-12 07:11:01,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-12 07:11:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 151 proven. 54 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-12 07:11:01,252 INFO L312 TraceCheckSpWp]: Computing backward predicates...