./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-91.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-91.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 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:22:14,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:22:14,183 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:14,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:22:14,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:22:14,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:22:14,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:22:14,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:22:14,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:22:14,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:22:14,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:22:14,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:22:14,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:22:14,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:22:14,242 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:22:14,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:22:14,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:22:14,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:22:14,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:22:14,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:22:14,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:22:14,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:22:14,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:22:14,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:22:14,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:22:14,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:22:14,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:22:14,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:22:14,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:22:14,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:22:14,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:22:14,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:22:14,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:22:14,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:22:14,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:22:14,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:22:14,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:22:14,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:22:14,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:22:14,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:22:14,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:22:14,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:22:14,251 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 -> 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 [2024-10-24 11:22:14,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:22:14,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:22:14,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:22:14,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:22:14,510 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:22:14,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-10-24 11:22:15,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:22:16,151 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:22:16,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-10-24 11:22:16,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d54dec85/fb221d9bf85048ac88b88bb6ecb69082/FLAGaf7767bde [2024-10-24 11:22:16,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d54dec85/fb221d9bf85048ac88b88bb6ecb69082 [2024-10-24 11:22:16,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:22:16,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:22:16,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:22:16,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:22:16,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:22:16,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:22:16" (1/1) ... [2024-10-24 11:22:16,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134015c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:16, skipping insertion in model container [2024-10-24 11:22:16,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:22:16" (1/1) ... [2024-10-24 11:22:16,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:22:16,717 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-91.i[916,929] [2024-10-24 11:22:16,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:22:16,788 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:22:16,796 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-91.i[916,929] [2024-10-24 11:22:16,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:22:16,842 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:22:16,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:16 WrapperNode [2024-10-24 11:22:16,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:22:16,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:22:16,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:22:16,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:22:16,849 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:16" (1/1) ... [2024-10-24 11:22:16,860 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:16" (1/1) ... [2024-10-24 11:22:16,888 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 582 [2024-10-24 11:22:16,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:22:16,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:22:16,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:22:16,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:22:16,899 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:16" (1/1) ... [2024-10-24 11:22:16,899 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:16" (1/1) ... [2024-10-24 11:22:16,914 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:16" (1/1) ... [2024-10-24 11:22:16,949 INFO L175 MemorySlicer]: Split 158 memory accesses to 4 slices as follows [2, 32, 38, 86]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 5, 6]. The 19 writes are split as follows [0, 3, 9, 7]. [2024-10-24 11:22:16,949 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:16" (1/1) ... [2024-10-24 11:22:16,950 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:16" (1/1) ... [2024-10-24 11:22:16,994 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:16" (1/1) ... [2024-10-24 11:22:17,005 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:16" (1/1) ... [2024-10-24 11:22:17,013 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:16" (1/1) ... [2024-10-24 11:22:17,015 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:16" (1/1) ... [2024-10-24 11:22:17,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:22:17,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:22:17,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:22:17,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:22:17,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:16" (1/1) ... [2024-10-24 11:22:17,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:22:17,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:22:17,070 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:17,073 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:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:22:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:22:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:22:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:22:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:22:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:22:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:22:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:22:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:22:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:22:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:22:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:22:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:22:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:22:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:22:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:22:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:22:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:22:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:22:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:22:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:22:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:22:17,114 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:22:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:22:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:22:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:22:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:22:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:22:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:22:17,254 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:22:17,255 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:22:17,667 INFO L? ?]: Removed 171 outVars from TransFormulas that were not future-live. [2024-10-24 11:22:17,667 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:22:17,690 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:22:17,691 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:22:17,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:22:17 BoogieIcfgContainer [2024-10-24 11:22:17,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:22:17,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:22:17,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:22:17,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:22:17,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:22:16" (1/3) ... [2024-10-24 11:22:17,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68eebb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:22:17, skipping insertion in model container [2024-10-24 11:22:17,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:16" (2/3) ... [2024-10-24 11:22:17,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68eebb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:22:17, skipping insertion in model container [2024-10-24 11:22:17,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:22:17" (3/3) ... [2024-10-24 11:22:17,697 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-91.i [2024-10-24 11:22:17,709 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:22:17,710 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:22:17,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:22:17,757 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;@651e3834, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:22:17,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:22:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 99 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:22:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:22:17,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:17,770 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:17,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash -768211268, now seen corresponding path program 1 times [2024-10-24 11:22:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:22:17,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417838435] [2024-10-24 11:22:17,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:17,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:22:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:22:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:22:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:22:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:22:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:22:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:22:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:22:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:22:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:22:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:22:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:22:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:22:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:22:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:22:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:22:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:22:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:22:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:22:18,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:22:18,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417838435] [2024-10-24 11:22:18,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417838435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:18,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:18,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:22:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894567397] [2024-10-24 11:22:18,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:18,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:22:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:22:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:22:18,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:22:18,145 INFO L87 Difference]: Start difference. First operand has 118 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 99 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:22:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:18,182 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2024-10-24 11:22:18,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:22:18,184 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2024-10-24 11:22:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:18,192 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:22:18,193 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:22:18,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:18,199 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:18,200 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:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:22:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-24 11:22:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:22:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-10-24 11:22:18,234 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 133 [2024-10-24 11:22:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:18,234 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-10-24 11:22:18,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:22:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-10-24 11:22:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:22:18,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:18,237 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:22:18,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:18,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash -580207458, now seen corresponding path program 1 times [2024-10-24 11:22:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:22:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367055343] [2024-10-24 11:22:18,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:18,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:22:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:22:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:22:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:22:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:22:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:22:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:22:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:22:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:22:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:22:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:22:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:22:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:22:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:22:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:22:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:22:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:22:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:22:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:22:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:22:18,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367055343] [2024-10-24 11:22:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367055343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:18,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:18,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:22:18,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239920667] [2024-10-24 11:22:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:18,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:22:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:22:18,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:22:18,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:22:18,540 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:22:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:18,594 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2024-10-24 11:22:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:22:18,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-24 11:22:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:18,597 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:22:18,597 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 11:22:18,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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:18,598 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:18,599 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:18,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 11:22:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-24 11:22:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 99 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:22:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-10-24 11:22:18,609 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 133 [2024-10-24 11:22:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:18,611 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-10-24 11:22:18,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:22:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-10-24 11:22:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:22:18,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:18,613 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:22:18,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:18,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:18,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1132001300, now seen corresponding path program 1 times [2024-10-24 11:22:18,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:22:18,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499291316] [2024-10-24 11:22:18,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:18,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:22:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:22:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:22:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:22:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:22:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:22:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:22:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:22:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:22:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:22:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:22:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:22:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:22:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:22:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:22:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:22:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:22:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:22:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:22:19,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:22:19,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499291316] [2024-10-24 11:22:19,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499291316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:19,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:19,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:22:19,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016321320] [2024-10-24 11:22:19,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:19,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:22:19,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:22:19,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:22:19,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:22:19,177 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:22:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:19,332 INFO L93 Difference]: Finished difference Result 321 states and 472 transitions. [2024-10-24 11:22:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:22:19,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 11:22:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:19,334 INFO L225 Difference]: With dead ends: 321 [2024-10-24 11:22:19,334 INFO L226 Difference]: Without dead ends: 204 [2024-10-24 11:22:19,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:22:19,336 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 109 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:19,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 904 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:22:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-24 11:22:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2024-10-24 11:22:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 178 states have (on average 1.4382022471910112) internal successors, (256), 179 states have internal predecessors, (256), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:22:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2024-10-24 11:22:19,364 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 135 [2024-10-24 11:22:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:19,365 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2024-10-24 11:22:19,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:22:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2024-10-24 11:22:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:22:19,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:19,367 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:22:19,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:19,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1105224291, now seen corresponding path program 1 times [2024-10-24 11:22:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:22:19,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030036209] [2024-10-24 11:22:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:19,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:22:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:22:19,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139262729] [2024-10-24 11:22:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:19,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:22:19,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:22:19,492 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:19,493 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:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:22:19,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:22:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:22:19,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:22:19,933 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:22:19,933 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:22:19,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:22:20,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:22:20,143 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 11:22:20,209 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:22:20,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:22:20 BoogieIcfgContainer [2024-10-24 11:22:20,211 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:22:20,211 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:22:20,212 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:22:20,212 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:22:20,212 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:17" (3/4) ... [2024-10-24 11:22:20,213 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:22:20,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:22:20,215 INFO L158 Benchmark]: Toolchain (without parser) took 3662.98ms. Allocated memory is still 220.2MB. Free memory was 150.6MB in the beginning and 77.5MB in the end (delta: 73.1MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2024-10-24 11:22:20,215 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:22:20,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.83ms. Allocated memory is still 220.2MB. Free memory was 150.6MB in the beginning and 133.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:22:20,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.64ms. Allocated memory is still 220.2MB. Free memory was 133.2MB in the beginning and 129.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:22:20,216 INFO L158 Benchmark]: Boogie Preprocessor took 140.12ms. Allocated memory is still 220.2MB. Free memory was 129.0MB in the beginning and 123.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:22:20,216 INFO L158 Benchmark]: RCFGBuilder took 661.39ms. Allocated memory is still 220.2MB. Free memory was 123.3MB in the beginning and 82.8MB in the end (delta: 40.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-24 11:22:20,216 INFO L158 Benchmark]: TraceAbstraction took 2518.41ms. Allocated memory is still 220.2MB. Free memory was 82.2MB in the beginning and 77.5MB in the end (delta: 4.7MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-10-24 11:22:20,217 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 220.2MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:22:20,218 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.83ms. Allocated memory is still 220.2MB. Free memory was 150.6MB in the beginning and 133.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.64ms. Allocated memory is still 220.2MB. Free memory was 133.2MB in the beginning and 129.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.12ms. Allocated memory is still 220.2MB. Free memory was 129.0MB in the beginning and 123.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 661.39ms. Allocated memory is still 220.2MB. Free memory was 123.3MB in the beginning and 82.8MB in the end (delta: 40.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2518.41ms. Allocated memory is still 220.2MB. Free memory was 82.2MB in the beginning and 77.5MB in the end (delta: 4.7MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 220.2MB. Free memory is still 77.5MB. 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 95, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L22-L24] float float_Array_0[3] = { -0.25, 8.4, 49.25 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L25-L27] signed short int signed_short_int_Array_0[5] = { 100, -4, 128, 10, 1 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][3] = { {64, 10, 64}, {16, 64, 100000000} }; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L64] float_Array_0[0] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[0] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L65] EXPR float_Array_0[0] [L65] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L65] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L66] float_Array_0[1] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[1] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L67] EXPR float_Array_0[1] [L67] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L68] float_Array_0[2] = __VERIFIER_nondet_float() [L69] EXPR float_Array_0[2] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L69] EXPR float_Array_0[2] [L69] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L69] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L70] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L71] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L71] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L71] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -32767) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L72] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L73] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L74] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L74] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= -1) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L74] RET assume_abort_if_not(signed_short_int_Array_0[2] >= -1) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L76] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L79] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L80] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L80] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L80] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L82] unsigned_long_int_Array_0[0][1] = __VERIFIER_nondet_ulong() [L83] EXPR unsigned_long_int_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L83] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L83] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] EXPR unsigned_long_int_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L85] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L86] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L88] unsigned_long_int_Array_0[0][2] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][2] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[0][2] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][2] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[0][2] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L103] RET updateVariables() [L104] CALL step() [L34] EXPR float_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L34] COND FALSE !(float_Array_0[2] >= 50.4f) [L37] EXPR unsigned_long_int_Array_0[0][2] [L37] EXPR unsigned_long_int_Array_0[1][2] [L37] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L37] COND FALSE !(unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) [L44] EXPR signed_short_int_Array_0[1] [L44] signed_short_int_Array_0[4] = signed_short_int_Array_0[1] [L46] EXPR unsigned_long_int_Array_0[1][1] [L46] EXPR unsigned_long_int_Array_0[0][2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L46] COND FALSE !(! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) [L49] EXPR unsigned_long_int_Array_0[0][1] [L49] EXPR unsigned_long_int_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L49] EXPR ((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L49] EXPR unsigned_long_int_Array_0[0][1] [L49] EXPR ((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L49] unsigned_long_int_Array_0[0][0] = ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))) [L51] EXPR unsigned_long_int_Array_0[1][0] [L51] EXPR unsigned_long_int_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L51] COND FALSE !(unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) [L60] EXPR signed_short_int_Array_0[3] [L60] signed_short_int_Array_0[0] = signed_short_int_Array_0[3] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR float_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1 [L95] EXPR unsigned_long_int_Array_0[1][2] [L95] EXPR unsigned_long_int_Array_0[0][2] [L95] EXPR unsigned_long_int_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]) [L95] EXPR unsigned_long_int_Array_0[0][2] [L95] EXPR ((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1 VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR (((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95] EXPR ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L95-L96] return ((((float_Array_0[2] >= 50.4f) ? (unsigned_long_int_Array_0[1][2] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][2]) > (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1]))))) : 1) && ((unsigned_long_int_Array_0[0][2] == (unsigned_long_int_Array_0[1][2] * unsigned_long_int_Array_0[1][1])) ? ((float_Array_0[2] >= (float_Array_0[1] + float_Array_0[0])) ? (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) : (signed_short_int_Array_0[4] == ((signed short int) 32))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])))) && ((! (unsigned_long_int_Array_0[1][1] < unsigned_long_int_Array_0[0][2])) ? (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) < (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1]))))) ? (((((unsigned_long_int_Array_0[0][2]) < (unsigned_long_int_Array_0[1][1])) ? (unsigned_long_int_Array_0[0][2]) : (unsigned_long_int_Array_0[1][1])))) : (((((unsigned_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0][1])) ? (unsigned_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0][1])))))))) : (unsigned_long_int_Array_0[0][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))))))) && ((unsigned_long_int_Array_0[1][0] > unsigned_long_int_Array_0[0][0]) ? ((63.1 >= float_Array_0[0]) ? ((float_Array_0[0] >= float_Array_0[2]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[2] - signed_short_int_Array_0[3]))) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[2]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) signed_short_int_Array_0[3]))) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, signed_short_int_Array_0={5:0}, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 1563 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1038 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 525 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 671 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1632/1632 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:20,251 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-91.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 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:22:22,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:22:22,420 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:22,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:22:22,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:22:22,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:22:22,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:22:22,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:22:22,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:22:22,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:22:22,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:22:22,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:22:22,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:22:22,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:22:22,459 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:22:22,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:22:22,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:22:22,461 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:22:22,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:22:22,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:22:22,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:22:22,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:22:22,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:22:22,464 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:22:22,465 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:22:22,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:22:22,465 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:22:22,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:22:22,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:22:22,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:22:22,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:22:22,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:22:22,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:22:22,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:22:22,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:22:22,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:22:22,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:22:22,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:22:22,467 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:22:22,467 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:22:22,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:22:22,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:22:22,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:22:22,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:22:22,470 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:22:22,470 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 -> 742f62ff84f22bccca510ba2fb19e3898eba0b612c7ec1ceea7f75329541d889 [2024-10-24 11:22:22,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:22:22,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:22:22,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:22:22,772 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:22:22,773 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:22:22,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-10-24 11:22:24,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:22:24,377 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:22:24,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-91.i [2024-10-24 11:22:24,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97533411/faadf68609ee4bc7b233340593562b5f/FLAGefb068b3d [2024-10-24 11:22:24,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97533411/faadf68609ee4bc7b233340593562b5f [2024-10-24 11:22:24,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:22:24,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:22:24,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:22:24,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:22:24,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:22:24,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:22:24" (1/1) ... [2024-10-24 11:22:24,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ed3d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:24, skipping insertion in model container [2024-10-24 11:22:24,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:22:24" (1/1) ... [2024-10-24 11:22:24,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:22:24,917 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-91.i[916,929] [2024-10-24 11:22:24,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:22:25,003 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:22:25,032 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-91.i[916,929] [2024-10-24 11:22:25,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:22:25,113 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:22:25,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:25 WrapperNode [2024-10-24 11:22:25,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:22:25,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:22:25,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:22:25,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:22:25,120 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:25" (1/1) ... [2024-10-24 11:22:25,137 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:25" (1/1) ... [2024-10-24 11:22:25,187 INFO L138 Inliner]: procedures = 36, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 579 [2024-10-24 11:22:25,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:22:25,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:22:25,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:22:25,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:22:25,203 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:25" (1/1) ... [2024-10-24 11:22:25,203 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:25" (1/1) ... [2024-10-24 11:22:25,212 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:25" (1/1) ... [2024-10-24 11:22:25,247 INFO L175 MemorySlicer]: Split 158 memory accesses to 4 slices as follows [2, 32, 38, 86]. 54 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 5, 6]. The 19 writes are split as follows [0, 3, 9, 7]. [2024-10-24 11:22:25,248 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:25" (1/1) ... [2024-10-24 11:22:25,248 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:25" (1/1) ... [2024-10-24 11:22:25,275 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:25" (1/1) ... [2024-10-24 11:22:25,282 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:25" (1/1) ... [2024-10-24 11:22:25,289 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:25" (1/1) ... [2024-10-24 11:22:25,291 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:25" (1/1) ... [2024-10-24 11:22:25,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:22:25,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:22:25,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:22:25,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:22:25,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:25" (1/1) ... [2024-10-24 11:22:25,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:22:25,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:22:25,331 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:25,334 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:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:22:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:22:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:22:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:22:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:22:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:22:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:22:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:22:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:22:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:22:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:22:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 11:22:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 11:22:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:22:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:22:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:22:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:22:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:22:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:22:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 11:22:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 11:22:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:22:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:22:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:22:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:22:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:22:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:22:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:22:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:22:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:22:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:22:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:22:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:22:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:22:25,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:22:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:22:25,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:22:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:22:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:22:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:22:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:22:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:22:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:22:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 11:22:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 11:22:25,518 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:22:25,520 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:22:26,403 INFO L? ?]: Removed 171 outVars from TransFormulas that were not future-live. [2024-10-24 11:22:26,404 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:22:26,469 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:22:26,469 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:22:26,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:22:26 BoogieIcfgContainer [2024-10-24 11:22:26,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:22:26,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:22:26,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:22:26,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:22:26,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:22:24" (1/3) ... [2024-10-24 11:22:26,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267f88bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:22:26, skipping insertion in model container [2024-10-24 11:22:26,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:22:25" (2/3) ... [2024-10-24 11:22:26,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267f88bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:22:26, skipping insertion in model container [2024-10-24 11:22:26,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:22:26" (3/3) ... [2024-10-24 11:22:26,484 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-91.i [2024-10-24 11:22:26,513 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:22:26,513 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:22:26,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:22:26,633 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;@3717e4aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:22:26,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:22:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 99 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:22:26,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:22:26,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:26,664 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:26,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash -768211268, now seen corresponding path program 1 times [2024-10-24 11:22:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:26,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158873331] [2024-10-24 11:22:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:26,700 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:26,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:26,706 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:26,708 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:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:26,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:22:26,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-24 11:22:27,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:27,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:27,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158873331] [2024-10-24 11:22:27,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158873331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:27,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:27,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:22:27,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984818468] [2024-10-24 11:22:27,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:27,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:22:27,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:27,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:22:27,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:22:27,114 INFO L87 Difference]: Start difference. First operand has 118 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 99 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:22:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:27,157 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2024-10-24 11:22:27,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:22:27,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2024-10-24 11:22:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:27,165 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:22:27,165 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:22:27,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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:27,171 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:27,172 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:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:22:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-24 11:22:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:22:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-10-24 11:22:27,241 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 133 [2024-10-24 11:22:27,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:27,242 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-10-24 11:22:27,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:22:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-10-24 11:22:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:22:27,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:27,244 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,252 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:27,445 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:27,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:27,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:27,446 INFO L85 PathProgramCache]: Analyzing trace with hash -580207458, now seen corresponding path program 1 times [2024-10-24 11:22:27,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:27,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655936481] [2024-10-24 11:22:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:27,447 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:27,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:27,449 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:27,450 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:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:27,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:22:27,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:22:27,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:27,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:27,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655936481] [2024-10-24 11:22:27,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655936481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:27,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:27,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:22:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621744906] [2024-10-24 11:22:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:27,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:22:27,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:27,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:22:27,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:22:27,760 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:22:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:27,854 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2024-10-24 11:22:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:22:27,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-24 11:22:27,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:27,857 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:22:27,857 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 11:22:27,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 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:27,862 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:27,863 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.1s Time] [2024-10-24 11:22:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 11:22:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-24 11:22:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 99 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:22:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-10-24 11:22:27,902 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 133 [2024-10-24 11:22:27,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:27,903 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-10-24 11:22:27,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:22:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-10-24 11:22:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:22:27,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:27,912 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,926 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:28,112 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:28,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:28,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1132001300, now seen corresponding path program 1 times [2024-10-24 11:22:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:28,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278675230] [2024-10-24 11:22:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:28,115 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:28,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:28,119 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:28,119 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:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:28,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:22:28,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:28,770 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:22:28,778 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:22:28,787 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:22:28,794 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 21 treesize of output 21 [2024-10-24 11:22:28,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:22:28,833 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 33 treesize of output 24 [2024-10-24 11:22:28,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:22:28,873 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 66 treesize of output 30 [2024-10-24 11:22:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:22:28,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:28,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278675230] [2024-10-24 11:22:28,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278675230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:28,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:28,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:22:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443783714] [2024-10-24 11:22:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:28,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:22:28,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:28,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:22:28,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:22:28,904 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:22:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:29,383 INFO L93 Difference]: Finished difference Result 321 states and 472 transitions. [2024-10-24 11:22:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:22:29,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 11:22:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:29,387 INFO L225 Difference]: With dead ends: 321 [2024-10-24 11:22:29,387 INFO L226 Difference]: Without dead ends: 204 [2024-10-24 11:22:29,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:22:29,388 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 109 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:29,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 904 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:22:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-24 11:22:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2024-10-24 11:22:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 178 states have (on average 1.4382022471910112) internal successors, (256), 179 states have internal predecessors, (256), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:22:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2024-10-24 11:22:29,405 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 135 [2024-10-24 11:22:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:29,405 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2024-10-24 11:22:29,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:22:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2024-10-24 11:22:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:22:29,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:29,407 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,417 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:29,611 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:29,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:29,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:29,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1105224291, now seen corresponding path program 1 times [2024-10-24 11:22:29,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:29,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100607464] [2024-10-24 11:22:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:29,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:22:29,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:29,620 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:29,621 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:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:29,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:22:29,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:30,489 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:22:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-24 11:22:30,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:30,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100607464] [2024-10-24 11:22:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100607464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:30,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:30,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:22:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845001355] [2024-10-24 11:22:30,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:30,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:22:30,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:30,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:22:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:22:30,525 INFO L87 Difference]: Start difference. First operand 201 states and 296 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:22:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:32,188 INFO L93 Difference]: Finished difference Result 587 states and 864 transitions. [2024-10-24 11:22:32,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:22:32,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2024-10-24 11:22:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:32,193 INFO L225 Difference]: With dead ends: 587 [2024-10-24 11:22:32,193 INFO L226 Difference]: Without dead ends: 387 [2024-10-24 11:22:32,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:22:32,194 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 254 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:32,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 606 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 11:22:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-24 11:22:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2024-10-24 11:22:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 338 states have (on average 1.4319526627218935) internal successors, (484), 342 states have internal predecessors, (484), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:22:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 564 transitions. [2024-10-24 11:22:32,218 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 564 transitions. Word has length 135 [2024-10-24 11:22:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:32,218 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 564 transitions. [2024-10-24 11:22:32,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:22:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 564 transitions. [2024-10-24 11:22:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:22:32,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:32,221 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:22:32,424 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:32,425 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:32,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1260810779, now seen corresponding path program 1 times [2024-10-24 11:22:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:32,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653212776] [2024-10-24 11:22:32,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:32,428 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:32,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:32,433 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:32,435 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:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:22:32,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:22:32,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:22:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-24 11:22:32,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:22:32,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:22:32,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653212776] [2024-10-24 11:22:32,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653212776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:22:32,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:22:32,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:22:32,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968825639] [2024-10-24 11:22:32,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:22:32,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:22:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:22:32,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:22:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:22:32,628 INFO L87 Difference]: Start difference. First operand 383 states and 564 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:22:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:22:32,669 INFO L93 Difference]: Finished difference Result 765 states and 1127 transitions. [2024-10-24 11:22:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:22:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2024-10-24 11:22:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:22:32,671 INFO L225 Difference]: With dead ends: 765 [2024-10-24 11:22:32,671 INFO L226 Difference]: Without dead ends: 383 [2024-10-24 11:22:32,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 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:32,673 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:22:32,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:22:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-24 11:22:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-10-24 11:22:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 338 states have (on average 1.4260355029585798) internal successors, (482), 342 states have internal predecessors, (482), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:22:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 562 transitions. [2024-10-24 11:22:32,688 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 562 transitions. Word has length 135 [2024-10-24 11:22:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:22:32,689 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 562 transitions. [2024-10-24 11:22:32,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:22:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 562 transitions. [2024-10-24 11:22:32,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:22:32,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:22:32,691 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,704 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:32,894 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:32,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:22:32,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:22:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1431676015, now seen corresponding path program 1 times [2024-10-24 11:22:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:22:32,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195148715] [2024-10-24 11:22:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:22:32,896 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:32,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:22:32,898 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:32,900 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