./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.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 70562da18636cefe71b678cd2257e55ff14c212499b21f4a61292b200a6210e2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:22:39,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:22:39,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:22:39,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:22:39,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:22:39,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:22:39,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:22:39,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:22:39,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:22:39,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:22:39,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:22:39,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:22:39,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:22:39,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:22:39,647 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:22:39,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:22:39,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:22:39,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:22:39,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:22:39,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:22:39,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:22:39,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:22:39,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:22:39,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:22:39,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:22:39,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:22:39,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:22:39,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:22:39,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:22:39,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:22:39,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:22:39,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:22:39,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:22:39,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:22:39,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:22:39,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:22:39,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:22:39,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:22:39,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:22:39,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:22:39,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:22:39,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:22:39,656 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 -> 70562da18636cefe71b678cd2257e55ff14c212499b21f4a61292b200a6210e2 [2024-10-24 11:22:39,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:22:39,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:22:39,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:22:39,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:22:39,932 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:22:39,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i [2024-10-24 11:22:41,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:22:41,405 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:22:41,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i [2024-10-24 11:22:41,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da8647f0/f2d0e8e56ecd4327b0913ac1dab9c0ef/FLAG1f719288d [2024-10-24 11:22:41,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da8647f0/f2d0e8e56ecd4327b0913ac1dab9c0ef [2024-10-24 11:22:41,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:22:41,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:22:41,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:22:41,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:22:41,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:22:41,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28324f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41, skipping insertion in model container [2024-10-24 11:22:41,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:22:41,608 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i[916,929] [2024-10-24 11:22:41,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:22:41,711 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:22:41,724 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i[916,929] [2024-10-24 11:22:41,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:22:41,792 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:22:41,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41 WrapperNode [2024-10-24 11:22:41,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:22:41,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:22:41,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:22:41,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:22:41,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,855 INFO L138 Inliner]: procedures = 29, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 558 [2024-10-24 11:22:41,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:22:41,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:22:41,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:22:41,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:22:41,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,894 INFO L175 MemorySlicer]: Split 152 memory accesses to 6 slices as follows [2, 6, 71, 48, 11, 14]. 47 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 7, 5, 1, 1]. The 19 writes are split as follows [0, 1, 8, 8, 1, 1]. [2024-10-24 11:22:41,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:22:41,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:22:41,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:22:41,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:22:41,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (1/1) ... [2024-10-24 11:22:41,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:22:41,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:22:41,979 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-10-24 11:22:41,982 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-10-24 11:22:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:22:42,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:22:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:22:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:22:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:22:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:22:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:22:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:22:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:22:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:22:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:22:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:22:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:22:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:22:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:22:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:22:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:22:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:22:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:22:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:22:42,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:22:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:22:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:22:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:22:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:22:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:22:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:22:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:22:42,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:22:42,168 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:22:42,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:22:42,691 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-10-24 11:22:42,691 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:22:42,727 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:22:42,728 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:22:42,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:22:42 BoogieIcfgContainer [2024-10-24 11:22:42,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:22:42,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:22:42,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:22:42,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:22:42,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:22:41" (1/3) ... [2024-10-24 11:22:42,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46339747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:22:42, skipping insertion in model container [2024-10-24 11:22:42,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:41" (2/3) ... [2024-10-24 11:22:42,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46339747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:22:42, skipping insertion in model container [2024-10-24 11:22:42,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:22:42" (3/3) ... [2024-10-24 11:22:42,738 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-99.i [2024-10-24 11:22:42,753 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:22:42,753 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:22:42,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:22:42,813 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;@15db4fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:22:42,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:22:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:22:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 11:22:42,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:42,830 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:42,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:42,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1443238755, now seen corresponding path program 1 times [2024-10-24 11:22:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:22:42,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627528445] [2024-10-24 11:22:42,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:42,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:22:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:22:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:22:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:22:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:22:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:22:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:22:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:22:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:22:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:22:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:22:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:22:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:22:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:22:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:22:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:22:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:22:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:22:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:22:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:22:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:22:43,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:22:43,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627528445] [2024-10-24 11:22:43,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627528445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:43,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:43,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:22:43,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607165705] [2024-10-24 11:22:43,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:43,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:22:43,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:22:43,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:22:43,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:22:43,270 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:43,320 INFO L93 Difference]: Finished difference Result 233 states and 371 transitions. [2024-10-24 11:22:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:22:43,324 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-10-24 11:22:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:43,330 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:22:43,330 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:22:43,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:22:43,338 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:43,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:22:43,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:22:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-24 11:22:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:22:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-10-24 11:22:43,375 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 151 [2024-10-24 11:22:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:43,375 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-10-24 11:22:43,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-10-24 11:22:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 11:22:43,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:43,381 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:43,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:22:43,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:43,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:43,382 INFO L85 PathProgramCache]: Analyzing trace with hash 871627069, now seen corresponding path program 1 times [2024-10-24 11:22:43,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:22:43,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446871598] [2024-10-24 11:22:43,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:43,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:22:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:22:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:22:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:22:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:22:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:22:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:22:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:22:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:22:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:22:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:22:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:22:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:22:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:22:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:22:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:22:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:22:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:22:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:22:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:22:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:22:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:22:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446871598] [2024-10-24 11:22:43,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446871598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:43,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:43,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:22:43,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292070106] [2024-10-24 11:22:43,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:43,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:22:43,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:22:43,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:22:43,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:22:43,692 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:43,739 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2024-10-24 11:22:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:22:43,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-10-24 11:22:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:43,741 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:22:43,741 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 11:22:43,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-10-24 11:22:43,744 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:43,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:22:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 11:22:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-24 11:22:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.402061855670103) internal successors, (136), 97 states have internal predecessors, (136), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:22:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-10-24 11:22:43,766 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 151 [2024-10-24 11:22:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:43,767 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-10-24 11:22:43,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-10-24 11:22:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 11:22:43,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:43,769 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:43,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:22:43,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:43,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:43,770 INFO L85 PathProgramCache]: Analyzing trace with hash 801979195, now seen corresponding path program 1 times [2024-10-24 11:22:43,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:22:43,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430924587] [2024-10-24 11:22:43,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:43,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:22:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:22:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:22:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:22:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:22:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:22:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:22:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:22:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:22:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:22:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:22:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:22:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:22:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:22:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:22:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:22:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:22:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:22:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:22:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:22:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:22:44,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:22:44,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430924587] [2024-10-24 11:22:44,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430924587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:44,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:44,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:22:44,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704999965] [2024-10-24 11:22:44,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:44,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:22:44,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:22:44,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:22:44,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:22:44,390 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:44,638 INFO L93 Difference]: Finished difference Result 340 states and 501 transitions. [2024-10-24 11:22:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:22:44,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-10-24 11:22:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:44,642 INFO L225 Difference]: With dead ends: 340 [2024-10-24 11:22:44,644 INFO L226 Difference]: Without dead ends: 223 [2024-10-24 11:22:44,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-10-24 11:22:44,646 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 150 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:44,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1099 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:22:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-24 11:22:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2024-10-24 11:22:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 181 states have (on average 1.3977900552486189) internal successors, (253), 182 states have internal predecessors, (253), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:22:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 325 transitions. [2024-10-24 11:22:44,677 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 325 transitions. Word has length 151 [2024-10-24 11:22:44,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:44,678 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 325 transitions. [2024-10-24 11:22:44,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 325 transitions. [2024-10-24 11:22:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 11:22:44,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:44,680 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:44,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:22:44,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:44,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1320890028, now seen corresponding path program 1 times [2024-10-24 11:22:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:22:44,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382707199] [2024-10-24 11:22:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:44,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:22:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:22:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:22:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:22:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:22:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:22:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:22:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:22:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:22:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:22:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:22:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:22:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:22:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:22:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:22:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:22:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:22:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:22:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 11:22:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 11:22:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:22:44,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:22:44,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382707199] [2024-10-24 11:22:44,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382707199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:44,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:44,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:22:44,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149938160] [2024-10-24 11:22:44,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:44,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:22:44,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:22:44,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:22:44,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:22:44,952 INFO L87 Difference]: Start difference. First operand 220 states and 325 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:22:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:44,995 INFO L93 Difference]: Finished difference Result 445 states and 657 transitions. [2024-10-24 11:22:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:22:44,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-10-24 11:22:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:45,004 INFO L225 Difference]: With dead ends: 445 [2024-10-24 11:22:45,004 INFO L226 Difference]: Without dead ends: 226 [2024-10-24 11:22:45,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:22:45,006 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:45,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 651 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:22:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-24 11:22:45,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-10-24 11:22:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 187 states have (on average 1.3850267379679144) internal successors, (259), 188 states have internal predecessors, (259), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:22:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 331 transitions. [2024-10-24 11:22:45,035 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 331 transitions. Word has length 151 [2024-10-24 11:22:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:45,036 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 331 transitions. [2024-10-24 11:22:45,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:22:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 331 transitions. [2024-10-24 11:22:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-24 11:22:45,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:45,040 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:45,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:22:45,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:45,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:45,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1366909361, now seen corresponding path program 1 times [2024-10-24 11:22:45,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:22:45,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758207651] [2024-10-24 11:22:45,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:22:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:22:45,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281683232] [2024-10-24 11:22:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:45,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:22:45,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:22:45,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:22:45,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:22:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:22:45,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:22:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:22:45,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:22:45,929 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:22:45,930 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:22:45,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:22:46,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:22:46,136 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 11:22:46,226 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:22:46,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:22:46 BoogieIcfgContainer [2024-10-24 11:22:46,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:22:46,229 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:22:46,229 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:22:46,229 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:22:46,230 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:22:42" (3/4) ... [2024-10-24 11:22:46,231 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:22:46,232 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:22:46,233 INFO L158 Benchmark]: Toolchain (without parser) took 4794.16ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 114.0MB in the beginning and 81.1MB in the end (delta: 32.9MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. [2024-10-24 11:22:46,233 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:22:46,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.38ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 97.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:22:46,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.86ms. Allocated memory is still 184.5MB. Free memory was 97.6MB in the beginning and 93.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:22:46,234 INFO L158 Benchmark]: Boogie Preprocessor took 89.77ms. Allocated memory is still 184.5MB. Free memory was 93.1MB in the beginning and 88.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:22:46,234 INFO L158 Benchmark]: RCFGBuilder took 782.09ms. Allocated memory is still 184.5MB. Free memory was 88.1MB in the beginning and 130.2MB in the end (delta: -42.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 11:22:46,234 INFO L158 Benchmark]: TraceAbstraction took 3496.83ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 129.2MB in the beginning and 81.1MB in the end (delta: 48.1MB). Peak memory consumption was 129.8MB. Max. memory is 16.1GB. [2024-10-24 11:22:46,235 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 264.2MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:22:46,238 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.19ms. Allocated memory is still 121.6MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.38ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 97.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.86ms. Allocated memory is still 184.5MB. Free memory was 97.6MB in the beginning and 93.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.77ms. Allocated memory is still 184.5MB. Free memory was 93.1MB in the beginning and 88.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 782.09ms. Allocated memory is still 184.5MB. Free memory was 88.1MB in the beginning and 130.2MB in the end (delta: -42.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3496.83ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 129.2MB in the beginning and 81.1MB in the end (delta: 48.1MB). Peak memory consumption was 129.8MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 264.2MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryArithmeticFLOAToperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 2 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 2 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 16 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 16 }; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L68] float_Array_0[0] = __VERIFIER_nondet_float() [L69] EXPR float_Array_0[0] [L69] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F [L69] EXPR float_Array_0[0] [L69] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] CALL assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] RET assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] float_Array_0[1] = __VERIFIER_nondet_float() [L71] EXPR float_Array_0[1] [L71] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F [L71] EXPR float_Array_0[1] [L71] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR (float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR (float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] CALL assume_abort_if_not((float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] RET assume_abort_if_not((float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] float_Array_0[2] = __VERIFIER_nondet_float() [L73] EXPR float_Array_0[2] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F [L73] EXPR float_Array_0[2] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] float_Array_0[3] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[3] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F [L75] EXPR float_Array_0[3] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] float_Array_0[4] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[4] [L77] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F [L77] EXPR float_Array_0[4] [L77] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] float_Array_0[5] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[5] [L79] EXPR float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F [L79] EXPR float_Array_0[5] [L79] EXPR float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR (float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F) || (float_Array_0[5] <= 9223372.036854765600e+12F && float_Array_0[5] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR (float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F) || (float_Array_0[5] <= 9223372.036854765600e+12F && float_Array_0[5] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] CALL assume_abort_if_not((float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F) || (float_Array_0[5] <= 9223372.036854765600e+12F && float_Array_0[5] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] RET assume_abort_if_not((float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F) || (float_Array_0[5] <= 9223372.036854765600e+12F && float_Array_0[5] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L81] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] signed_long_int_Array_0[1] = __VERIFIER_nondet_long() [L84] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] signed_long_int_Array_0[3] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[3] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[3] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[3] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[3] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L90] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L108] RET updateVariables() [L109] CALL step() [L40] signed long int stepLocal_0 = (((8) < 0 ) ? -(8) : (8)); [L41] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L41] COND TRUE (((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > stepLocal_0 [L42] EXPR float_Array_0[5] [L42] EXPR float_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L42] EXPR ((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]) [L42] EXPR float_Array_0[5] [L42] EXPR ((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L42] EXPR float_Array_0[3] [L42] float_Array_0[6] = (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]) [L48] EXPR float_Array_0[4] [L48] EXPR float_Array_0[3] [L48] EXPR float_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L48] COND FALSE !((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) [L51] EXPR signed_long_int_Array_0[1] [L51] signed_long_int_Array_0[2] = signed_long_int_Array_0[1] [L53] EXPR signed_long_int_Array_0[0] [L53] EXPR signed_short_int_Array_0[0] [L53] signed long int stepLocal_1 = signed_long_int_Array_0[0] % signed_short_int_Array_0[0]; [L54] EXPR float_Array_0[0] [L54] EXPR float_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L54] COND TRUE float_Array_0[0] == float_Array_0[5] [L55] EXPR signed_long_int_Array_0[1] [L55] signed_long_int_Array_0[4] = signed_long_int_Array_0[1] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR ((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1) [L100] EXPR float_Array_0[6] [L100] EXPR float_Array_0[5] [L100] EXPR float_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR ((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]) [L100] EXPR float_Array_0[5] [L100] EXPR ((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR float_Array_0[3] [L100] EXPR ((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR (((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1)) && (((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0]) : (signed_long_int_Array_0[0]))) - signed_long_int_Array_0[1]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_long_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR (((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1)) && (((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0]) : (signed_long_int_Array_0[0]))) - signed_long_int_Array_0[1]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_long_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR ((((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1)) && (((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0]) : (signed_long_int_Array_0[0]))) - signed_long_int_Array_0[1]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_long_int_Array_0[1])))) && ((float_Array_0[0] == float_Array_0[5]) ? (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[1])) : (((signed_long_int_Array_0[0] % signed_short_int_Array_0[0]) != signed_long_int_Array_0[1]) ? (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) > (signed_long_int_Array_0[1])) ? (((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) : (signed_long_int_Array_0[1]))))) : (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[3])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR ((((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1)) && (((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0]) : (signed_long_int_Array_0[0]))) - signed_long_int_Array_0[1]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_long_int_Array_0[1])))) && ((float_Array_0[0] == float_Array_0[5]) ? (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[1])) : (((signed_long_int_Array_0[0] % signed_short_int_Array_0[0]) != signed_long_int_Array_0[1]) ? (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) > (signed_long_int_Array_0[1])) ? (((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) : (signed_long_int_Array_0[1]))))) : (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[3])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100-L101] return ((((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1)) && (((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0]) : (signed_long_int_Array_0[0]))) - signed_long_int_Array_0[1]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_long_int_Array_0[1])))) && ((float_Array_0[0] == float_Array_0[5]) ? (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[1])) : (((signed_long_int_Array_0[0] % signed_short_int_Array_0[0]) != signed_long_int_Array_0[1]) ? (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) > (signed_long_int_Array_0[1])) ? (((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) : (signed_long_int_Array_0[1]))))) : (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[3])))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 2409 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1653 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 756 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=4, InterpolantAutomatonStates: 17, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 908 NumberOfCodeBlocks, 908 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2736/2736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:22:46,270 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.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 70562da18636cefe71b678cd2257e55ff14c212499b21f4a61292b200a6210e2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:22:48,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:22:48,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:22:48,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:22:48,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:22:48,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:22:48,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:22:48,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:22:48,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:22:48,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:22:48,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:22:48,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:22:48,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:22:48,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:22:48,457 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:22:48,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:22:48,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:22:48,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:22:48,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:22:48,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:22:48,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:22:48,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:22:48,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:22:48,460 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:22:48,460 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:22:48,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:22:48,461 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:22:48,461 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:22:48,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:22:48,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:22:48,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:22:48,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:22:48,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:22:48,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:22:48,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:22:48,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:22:48,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:22:48,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:22:48,464 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:22:48,464 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:22:48,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:22:48,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:22:48,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:22:48,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:22:48,465 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:22:48,465 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 -> 70562da18636cefe71b678cd2257e55ff14c212499b21f4a61292b200a6210e2 [2024-10-24 11:22:48,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:22:48,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:22:48,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:22:48,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:22:48,817 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:22:48,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i [2024-10-24 11:22:50,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:22:50,357 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:22:50,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i [2024-10-24 11:22:50,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b307aa0/131b0db3866f47388de13b32f2c2b30e/FLAG437e013a8 [2024-10-24 11:22:50,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b307aa0/131b0db3866f47388de13b32f2c2b30e [2024-10-24 11:22:50,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:22:50,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:22:50,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:22:50,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:22:50,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:22:50,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6cbe8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50, skipping insertion in model container [2024-10-24 11:22:50,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:22:50,588 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i[916,929] [2024-10-24 11:22:50,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:22:50,660 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:22:50,671 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i[916,929] [2024-10-24 11:22:50,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:22:50,739 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:22:50,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50 WrapperNode [2024-10-24 11:22:50,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:22:50,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:22:50,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:22:50,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:22:50,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,810 INFO L138 Inliner]: procedures = 36, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 554 [2024-10-24 11:22:50,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:22:50,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:22:50,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:22:50,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:22:50,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,843 INFO L175 MemorySlicer]: Split 152 memory accesses to 6 slices as follows [2, 6, 71, 48, 11, 14]. 47 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 7, 5, 1, 1]. The 19 writes are split as follows [0, 1, 8, 8, 1, 1]. [2024-10-24 11:22:50,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:22:50,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:22:50,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:22:50,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:22:50,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (1/1) ... [2024-10-24 11:22:50,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:22:50,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:22:50,939 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-10-24 11:22:50,941 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-10-24 11:22:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:22:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:22:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:22:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:22:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:22:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:22:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:22:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:22:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:22:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:22:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:22:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-24 11:22:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-24 11:22:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:22:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:22:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:22:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:22:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:22:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:22:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:22:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:22:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 11:22:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 11:22:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-24 11:22:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-24 11:22:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:22:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:22:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:22:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:22:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:22:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:22:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:22:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:22:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:22:50,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:22:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:22:50,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:22:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:22:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:22:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:22:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:22:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:22:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:22:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:22:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:22:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:22:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:22:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 11:22:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-24 11:22:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:22:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:22:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 11:22:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 11:22:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 11:22:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-24 11:22:51,119 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:22:51,121 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:22:52,110 INFO L? ?]: Removed 159 outVars from TransFormulas that were not future-live. [2024-10-24 11:22:52,111 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:22:52,145 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:22:52,148 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:22:52,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:22:52 BoogieIcfgContainer [2024-10-24 11:22:52,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:22:52,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:22:52,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:22:52,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:22:52,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:22:50" (1/3) ... [2024-10-24 11:22:52,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1b124c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:22:52, skipping insertion in model container [2024-10-24 11:22:52,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:50" (2/3) ... [2024-10-24 11:22:52,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1b124c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:22:52, skipping insertion in model container [2024-10-24 11:22:52,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:22:52" (3/3) ... [2024-10-24 11:22:52,156 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-99.i [2024-10-24 11:22:52,168 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:22:52,169 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:22:52,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:22:52,242 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;@402a0de6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:22:52,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:22:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:22:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 11:22:52,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:52,256 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:52,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:52,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1443238755, now seen corresponding path program 1 times [2024-10-24 11:22:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:52,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209407972] [2024-10-24 11:22:52,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:22:52,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:52,272 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-10-24 11:22:52,273 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-10-24 11:22:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:52,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:22:52,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-10-24 11:22:52,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:52,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209407972] [2024-10-24 11:22:52,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209407972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:52,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:52,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:22:52,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025875875] [2024-10-24 11:22:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:52,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:22:52,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:52,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:22:52,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:22:52,713 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:52,758 INFO L93 Difference]: Finished difference Result 233 states and 371 transitions. [2024-10-24 11:22:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:22:52,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-10-24 11:22:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:52,777 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:22:52,777 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:22:52,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:22:52,789 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:52,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:22:52,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:22:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-24 11:22:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:22:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-10-24 11:22:52,830 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 151 [2024-10-24 11:22:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:52,830 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-10-24 11:22:52,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-10-24 11:22:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 11:22:52,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:52,837 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:52,849 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-10-24 11:22:53,037 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-10-24 11:22:53,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:53,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash 871627069, now seen corresponding path program 1 times [2024-10-24 11:22:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:53,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863332092] [2024-10-24 11:22:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:53,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:22:53,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:53,044 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-10-24 11:22:53,046 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-10-24 11:22:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:53,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:22:53,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-24 11:22:53,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:53,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:53,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863332092] [2024-10-24 11:22:53,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863332092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:53,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:53,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:22:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889433280] [2024-10-24 11:22:53,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:53,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:22:53,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:53,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:22:53,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:22:53,443 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:53,505 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2024-10-24 11:22:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:22:53,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-10-24 11:22:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:53,507 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:22:53,507 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 11:22:53,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 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-10-24 11:22:53,509 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:53,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:22:53,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 11:22:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-24 11:22:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.402061855670103) internal successors, (136), 97 states have internal predecessors, (136), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:22:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-10-24 11:22:53,519 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 151 [2024-10-24 11:22:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:53,520 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-10-24 11:22:53,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-10-24 11:22:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 11:22:53,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:53,522 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:53,534 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-10-24 11:22:53,723 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-10-24 11:22:53,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:53,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:53,724 INFO L85 PathProgramCache]: Analyzing trace with hash 801979195, now seen corresponding path program 1 times [2024-10-24 11:22:53,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:53,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479596576] [2024-10-24 11:22:53,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:53,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:22:53,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:53,727 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-10-24 11:22:53,728 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-10-24 11:22:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:54,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:22:54,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:54,307 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 95 treesize of output 41 [2024-10-24 11:22:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-10-24 11:22:54,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:54,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:54,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479596576] [2024-10-24 11:22:54,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479596576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:54,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:54,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:22:54,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308763087] [2024-10-24 11:22:54,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:54,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:22:54,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:54,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:22:54,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:22:54,379 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:55,255 INFO L93 Difference]: Finished difference Result 236 states and 348 transitions. [2024-10-24 11:22:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:22:55,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-10-24 11:22:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:55,259 INFO L225 Difference]: With dead ends: 236 [2024-10-24 11:22:55,259 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 11:22:55,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 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-10-24 11:22:55,260 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 143 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:55,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 483 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:22:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 11:22:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-10-24 11:22:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:22:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 173 transitions. [2024-10-24 11:22:55,269 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 173 transitions. Word has length 151 [2024-10-24 11:22:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:55,269 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 173 transitions. [2024-10-24 11:22:55,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 173 transitions. [2024-10-24 11:22:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 11:22:55,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:55,272 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:55,283 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 (4)] Ended with exit code 0 [2024-10-24 11:22:55,472 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-10-24 11:22:55,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:55,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash -767774539, now seen corresponding path program 1 times [2024-10-24 11:22:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903802191] [2024-10-24 11:22:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:55,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:22:55,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:55,479 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-10-24 11:22:55,480 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-10-24 11:22:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:55,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:22:55,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:56,022 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 95 treesize of output 41 [2024-10-24 11:22:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-10-24 11:22:56,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:56,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:56,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903802191] [2024-10-24 11:22:56,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903802191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:56,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:56,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:22:56,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173288106] [2024-10-24 11:22:56,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:56,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:22:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:56,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:22:56,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:22:56,046 INFO L87 Difference]: Start difference. First operand 118 states and 173 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:56,812 INFO L93 Difference]: Finished difference Result 236 states and 346 transitions. [2024-10-24 11:22:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:22:56,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-10-24 11:22:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:56,814 INFO L225 Difference]: With dead ends: 236 [2024-10-24 11:22:56,814 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 11:22:56,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:22:56,815 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 133 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:56,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 479 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:22:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 11:22:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-10-24 11:22:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 97 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:22:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-10-24 11:22:56,826 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 153 [2024-10-24 11:22:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:56,826 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-10-24 11:22:56,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-10-24 11:22:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:22:56,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:56,832 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:56,847 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 (5)] Ended with exit code 0 [2024-10-24 11:22:57,036 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-10-24 11:22:57,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:57,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:57,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1798641275, now seen corresponding path program 1 times [2024-10-24 11:22:57,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:57,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770013968] [2024-10-24 11:22:57,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:57,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:22:57,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:57,040 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-10-24 11:22:57,041 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-10-24 11:22:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:57,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:22:57,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:57,546 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 95 treesize of output 41 [2024-10-24 11:22:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-10-24 11:22:57,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:57,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:57,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770013968] [2024-10-24 11:22:57,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770013968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:22:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808992887] [2024-10-24 11:22:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:57,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:22:57,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:57,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:22:57,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:22:57,575 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:58,418 INFO L93 Difference]: Finished difference Result 236 states and 344 transitions. [2024-10-24 11:22:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:22:58,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-10-24 11:22:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:58,423 INFO L225 Difference]: With dead ends: 236 [2024-10-24 11:22:58,424 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 11:22:58,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 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-10-24 11:22:58,425 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 125 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:58,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 474 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:22:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 11:22:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-10-24 11:22:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:22:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 171 transitions. [2024-10-24 11:22:58,441 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 171 transitions. Word has length 155 [2024-10-24 11:22:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:58,441 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 171 transitions. [2024-10-24 11:22:58,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:22:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 171 transitions. [2024-10-24 11:22:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 11:22:58,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:58,446 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:22:58,465 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-10-24 11:22:58,647 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-10-24 11:22:58,647 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:58,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:58,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1830050293, now seen corresponding path program 1 times [2024-10-24 11:22:58,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:58,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481813077] [2024-10-24 11:22:58,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:58,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:22:58,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:58,650 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-10-24 11:22:58,650 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-10-24 11:22:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:59,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:22:59,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:59,123 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 31 treesize of output 19 [2024-10-24 11:22:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 11:22:59,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:59,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:59,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481813077] [2024-10-24 11:22:59,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481813077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:59,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:59,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:22:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037324816] [2024-10-24 11:22:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:59,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:22:59,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:59,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:22:59,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:22:59,176 INFO L87 Difference]: Start difference. First operand 118 states and 171 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:23:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:23:00,184 INFO L93 Difference]: Finished difference Result 350 states and 501 transitions. [2024-10-24 11:23:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:23:00,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 157 [2024-10-24 11:23:00,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:23:00,187 INFO L225 Difference]: With dead ends: 350 [2024-10-24 11:23:00,187 INFO L226 Difference]: Without dead ends: 233 [2024-10-24 11:23:00,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:23:00,188 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 322 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:23:00,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1222 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:23:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-24 11:23:00,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 133. [2024-10-24 11:23:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3693693693693694) internal successors, (152), 111 states have internal predecessors, (152), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:23:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 190 transitions. [2024-10-24 11:23:00,198 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 190 transitions. Word has length 157 [2024-10-24 11:23:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:23:00,200 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 190 transitions. [2024-10-24 11:23:00,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:23:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 190 transitions. [2024-10-24 11:23:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 11:23:00,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:23:00,202 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:23:00,218 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 (7)] Forceful destruction successful, exit code 0 [2024-10-24 11:23:00,402 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-10-24 11:23:00,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:23:00,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:23:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash -292818930, now seen corresponding path program 1 times [2024-10-24 11:23:00,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:23:00,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828884436] [2024-10-24 11:23:00,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:23:00,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:23:00,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:23:00,405 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-10-24 11:23:00,406 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-10-24 11:23:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:23:00,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:23:00,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:23:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:23:00,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:23:00,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:23:00,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828884436] [2024-10-24 11:23:00,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828884436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:23:00,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:23:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:23:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478475101] [2024-10-24 11:23:00,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:23:00,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:23:00,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:23:00,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:23:00,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:23:00,750 INFO L87 Difference]: Start difference. First operand 133 states and 190 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:23:00,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:23:00,845 INFO L93 Difference]: Finished difference Result 268 states and 383 transitions. [2024-10-24 11:23:00,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:23:00,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-10-24 11:23:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:23:00,852 INFO L225 Difference]: With dead ends: 268 [2024-10-24 11:23:00,852 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 11:23:00,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:23:00,853 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:23:00,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 639 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:23:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 11:23:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-24 11:23:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.3596491228070176) internal successors, (155), 114 states have internal predecessors, (155), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:23:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 193 transitions. [2024-10-24 11:23:00,869 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 193 transitions. Word has length 157 [2024-10-24 11:23:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:23:00,870 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 193 transitions. [2024-10-24 11:23:00,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:23:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 193 transitions. [2024-10-24 11:23:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 11:23:00,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:23:00,871 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:23:00,883 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 (8)] Forceful destruction successful, exit code 0 [2024-10-24 11:23:01,071 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-10-24 11:23:01,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:23:01,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:23:01,072 INFO L85 PathProgramCache]: Analyzing trace with hash 438523605, now seen corresponding path program 1 times [2024-10-24 11:23:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:23:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259734756] [2024-10-24 11:23:01,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:23:01,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:23:01,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:23:01,074 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-10-24 11:23:01,075 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-10-24 11:23:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:23:01,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 11:23:01,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:23:01,664 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-10-24 11:23:01,852 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 44 treesize of output 20 [2024-10-24 11:23:01,942 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 44 treesize of output 20 [2024-10-24 11:23:02,032 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 44 treesize of output 20 [2024-10-24 11:23:02,133 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 44 treesize of output 20 [2024-10-24 11:23:02,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-10-24 11:23:03,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:23:03,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 102 treesize of output 51 [2024-10-24 11:23:03,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:23:03,564 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 131 treesize of output 53 [2024-10-24 11:23:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 369 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:23:03,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:23:04,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:23:04,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259734756] [2024-10-24 11:23:04,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259734756] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:23:04,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [531130453] [2024-10-24 11:23:04,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:23:04,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:23:04,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:23:04,494 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:23:04,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-24 11:23:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:23:06,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-24 11:23:06,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:23:06,930 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 15 treesize of output 1 [2024-10-24 11:23:07,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-24 11:23:07,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-24 11:23:07,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-24 11:23:07,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-24 11:23:08,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-24 11:23:10,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:23:10,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 61 [2024-10-24 11:23:10,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:23:10,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 65 [2024-10-24 11:23:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 369 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:23:10,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:23:10,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [531130453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:23:10,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:23:10,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2024-10-24 11:23:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835399238] [2024-10-24 11:23:10,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:23:10,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-24 11:23:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:23:10,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-24 11:23:10,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2024-10-24 11:23:10,666 INFO L87 Difference]: Start difference. First operand 136 states and 193 transitions. Second operand has 31 states, 29 states have (on average 4.793103448275862) internal successors, (139), 28 states have internal predecessors, (139), 8 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 8 states have call successors, (38) [2024-10-24 11:23:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:23:17,160 INFO L93 Difference]: Finished difference Result 598 states and 840 transitions. [2024-10-24 11:23:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 11:23:17,161 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 4.793103448275862) internal successors, (139), 28 states have internal predecessors, (139), 8 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 8 states have call successors, (38) Word has length 158 [2024-10-24 11:23:17,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:23:17,163 INFO L225 Difference]: With dead ends: 598 [2024-10-24 11:23:17,164 INFO L226 Difference]: Without dead ends: 463 [2024-10-24 11:23:17,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 467 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=590, Invalid=2166, Unknown=0, NotChecked=0, Total=2756 [2024-10-24 11:23:17,167 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 921 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 2027 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:23:17,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 1619 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2027 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-24 11:23:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-24 11:23:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 450. [2024-10-24 11:23:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 374 states have (on average 1.3475935828877006) internal successors, (504), 377 states have internal predecessors, (504), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-24 11:23:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 636 transitions. [2024-10-24 11:23:17,200 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 636 transitions. Word has length 158 [2024-10-24 11:23:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:23:17,202 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 636 transitions. [2024-10-24 11:23:17,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 4.793103448275862) internal successors, (139), 28 states have internal predecessors, (139), 8 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 8 states have call successors, (38) [2024-10-24 11:23:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 636 transitions. [2024-10-24 11:23:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 11:23:17,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:23:17,206 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:23:17,221 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-10-24 11:23:17,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-10-24 11:23:17,610 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 11:23:17,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:23:17,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:23:17,612 INFO L85 PathProgramCache]: Analyzing trace with hash 410023315, now seen corresponding path program 1 times [2024-10-24 11:23:17,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:23:17,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858245489] [2024-10-24 11:23:17,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:23:17,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:23:17,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:23:17,614 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10-24 11:23:17,614 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 (11)] Waiting until timeout for monitored process [2024-10-24 11:23:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:23:17,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:23:17,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:23:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-10-24 11:23:18,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:23:18,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:23:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858245489] [2024-10-24 11:23:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858245489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:23:18,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:23:18,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:23:18,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314865179] [2024-10-24 11:23:18,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:23:18,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:23:18,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:23:18,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:23:18,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:23:18,006 INFO L87 Difference]: Start difference. First operand 450 states and 636 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 11:23:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:23:18,173 INFO L93 Difference]: Finished difference Result 830 states and 1166 transitions. [2024-10-24 11:23:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:23:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 158 [2024-10-24 11:23:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:23:18,178 INFO L225 Difference]: With dead ends: 830 [2024-10-24 11:23:18,178 INFO L226 Difference]: Without dead ends: 371 [2024-10-24 11:23:18,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 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-10-24 11:23:18,181 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:23:18,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 675 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:23:18,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-24 11:23:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 359. [2024-10-24 11:23:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 299 states have (on average 1.3377926421404682) internal successors, (400), 301 states have internal predecessors, (400), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 11:23:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 504 transitions. [2024-10-24 11:23:18,216 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 504 transitions. Word has length 158 [2024-10-24 11:23:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:23:18,216 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 504 transitions. [2024-10-24 11:23:18,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 11:23:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 504 transitions. [2024-10-24 11:23:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 11:23:18,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:23:18,219 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:23:18,232 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 (11)] Ended with exit code 0 [2024-10-24 11:23:18,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-10-24 11:23:18,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:23:18,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:23:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1789908823, now seen corresponding path program 1 times [2024-10-24 11:23:18,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:23:18,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334171271] [2024-10-24 11:23:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:23:18,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:23:18,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:23:18,426 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10-24 11:23:18,427 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 (12)] Waiting until timeout for monitored process [2024-10-24 11:23:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:23:18,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:23:18,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:23:18,928 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 94 treesize of output 40 [2024-10-24 11:23:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 352 proven. 28 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-10-24 11:23:18,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:23:19,108 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 58 treesize of output 22 [2024-10-24 11:23:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 11:23:19,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:23:19,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334171271] [2024-10-24 11:23:19,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334171271] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:23:19,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:23:19,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-24 11:23:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839077138] [2024-10-24 11:23:19,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:23:19,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:23:19,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:23:19,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:23:19,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:23:19,129 INFO L87 Difference]: Start difference. First operand 359 states and 504 transitions. Second operand has 12 states, 11 states have (on average 9.909090909090908) internal successors, (109), 12 states have internal predecessors, (109), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-10-24 11:23:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:23:20,239 INFO L93 Difference]: Finished difference Result 653 states and 904 transitions. [2024-10-24 11:23:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:23:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.909090909090908) internal successors, (109), 12 states have internal predecessors, (109), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) Word has length 158 [2024-10-24 11:23:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:23:20,242 INFO L225 Difference]: With dead ends: 653 [2024-10-24 11:23:20,242 INFO L226 Difference]: Without dead ends: 277 [2024-10-24 11:23:20,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:23:20,243 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 122 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:23:20,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 588 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:23:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-24 11:23:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 269. [2024-10-24 11:23:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 224 states have (on average 1.3258928571428572) internal successors, (297), 225 states have internal predecessors, (297), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:23:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 373 transitions. [2024-10-24 11:23:20,259 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 373 transitions. Word has length 158 [2024-10-24 11:23:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:23:20,259 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 373 transitions. [2024-10-24 11:23:20,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.909090909090908) internal successors, (109), 12 states have internal predecessors, (109), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-10-24 11:23:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 373 transitions. [2024-10-24 11:23:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-24 11:23:20,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:23:20,261 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:23:20,276 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 (12)] Ended with exit code 0 [2024-10-24 11:23:20,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-10-24 11:23:20,461 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:23:20,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:23:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash -881910513, now seen corresponding path program 1 times [2024-10-24 11:23:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:23:20,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806008432] [2024-10-24 11:23:20,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:23:20,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:23:20,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:23:20,463 INFO L229 MonitoredProcess]: Starting monitored process 13 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-10-24 11:23:20,464 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 (13)] Waiting until timeout for monitored process [2024-10-24 11:23:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:23:39,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-24 11:23:39,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:23:39,625 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 19 treesize of output 1 [2024-10-24 11:23:40,047 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 78 treesize of output 32 [2024-10-24 11:23:40,154 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 78 treesize of output 32 [2024-10-24 11:23:42,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:23:42,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 214 treesize of output 105 [2024-10-24 11:23:50,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:23:50,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 361 treesize of output 127 [2024-10-24 11:23:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 355 proven. 69 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-24 11:23:51,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:24:05,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:24:05,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806008432] [2024-10-24 11:24:05,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806008432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:24:05,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [421556085] [2024-10-24 11:24:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:05,375 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:24:05,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:24:05,377 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:24:05,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process