./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-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:15:34,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:15:34,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:15:34,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:15:34,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:15:34,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:15:34,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:15:34,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:15:34,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:15:34,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:15:34,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:15:34,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:15:34,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:15:34,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:15:34,953 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:15:34,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:15:34,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:15:34,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:15:34,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:15:34,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:15:34,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:15:34,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:15:34,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:15:34,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:15:34,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:15:34,960 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:15:34,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:15:34,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:15:34,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:15:34,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:15:34,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:15:34,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:15:34,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:15:34,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:15:34,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:15:34,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:15:34,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:15:34,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:15:34,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:15:34,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:15:34,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:15:34,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:15:34,967 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2024-10-11 13:15:35,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:15:35,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:15:35,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:15:35,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:15:35,224 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:15:35,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-10-11 13:15:36,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:15:36,917 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:15:36,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-10-11 13:15:36,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8cbc05ac1/753503d0fb944d11b1eb2f992c6fee15/FLAGe22b431f2 [2024-10-11 13:15:36,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8cbc05ac1/753503d0fb944d11b1eb2f992c6fee15 [2024-10-11 13:15:36,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:15:36,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:15:36,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:15:36,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:15:36,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:15:36,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:15:36" (1/1) ... [2024-10-11 13:15:36,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e76243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:36, skipping insertion in model container [2024-10-11 13:15:36,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:15:36" (1/1) ... [2024-10-11 13:15:36,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:15:37,151 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-29.i[916,929] [2024-10-11 13:15:37,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:15:37,212 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:15:37,221 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-29.i[916,929] [2024-10-11 13:15:37,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:15:37,332 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:15:37,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37 WrapperNode [2024-10-11 13:15:37,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:15:37,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:15:37,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:15:37,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:15:37,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,390 INFO L138 Inliner]: procedures = 29, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2024-10-11 13:15:37,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:15:37,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:15:37,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:15:37,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:15:37,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,436 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2024-10-11 13:15:37,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:15:37,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:15:37,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:15:37,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:15:37,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (1/1) ... [2024-10-11 13:15:37,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:15:37,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:15:37,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:15:37,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:15:37,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:15:37,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:15:37,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:15:37,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:15:37,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:15:37,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:15:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:15:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:15:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:15:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:15:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:15:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:15:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:15:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:15:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:15:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:15:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:15:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:15:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:15:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:15:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:15:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:15:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:15:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:15:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:15:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:15:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:15:37,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:15:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:15:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:15:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:15:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:15:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:15:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:15:37,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:15:37,684 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:15:37,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:15:38,000 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-11 13:15:38,000 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:15:38,030 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:15:38,030 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:15:38,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:15:38 BoogieIcfgContainer [2024-10-11 13:15:38,031 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:15:38,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:15:38,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:15:38,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:15:38,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:15:36" (1/3) ... [2024-10-11 13:15:38,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6352a837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:15:38, skipping insertion in model container [2024-10-11 13:15:38,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:37" (2/3) ... [2024-10-11 13:15:38,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6352a837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:15:38, skipping insertion in model container [2024-10-11 13:15:38,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:15:38" (3/3) ... [2024-10-11 13:15:38,037 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2024-10-11 13:15:38,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:15:38,049 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:15:38,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:15:38,126 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;@1824f9bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:15:38,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:15:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:15:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:15:38,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:38,138 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:38,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:38,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:38,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1505659447, now seen corresponding path program 1 times [2024-10-11 13:15:38,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:15:38,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745979026] [2024-10-11 13:15:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:38,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:15:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:15:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:15:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:15:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:15:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:15:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:15:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:15:38,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:15:38,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745979026] [2024-10-11 13:15:38,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745979026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:38,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:38,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:15:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663023065] [2024-10-11 13:15:38,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:38,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:15:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:15:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:15:38,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:15:38,407 INFO L87 Difference]: Start difference. First operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:15:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:38,445 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2024-10-11 13:15:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:15:38,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-11 13:15:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:38,454 INFO L225 Difference]: With dead ends: 159 [2024-10-11 13:15:38,454 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 13:15:38,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:15:38,460 INFO L432 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:38,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:15:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 13:15:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 13:15:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 71 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:15:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-10-11 13:15:38,497 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 68 [2024-10-11 13:15:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:38,497 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-10-11 13:15:38,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:15:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-10-11 13:15:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:15:38,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:38,500 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:38,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:15:38,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:38,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:38,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2039180527, now seen corresponding path program 1 times [2024-10-11 13:15:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:15:38,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49818426] [2024-10-11 13:15:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:15:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:15:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:15:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:15:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:15:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:15:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:15:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:15:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:15:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49818426] [2024-10-11 13:15:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49818426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:38,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:38,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:15:38,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076777745] [2024-10-11 13:15:38,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:38,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:15:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:15:38,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:15:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:15:38,747 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:15:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:38,781 INFO L93 Difference]: Finished difference Result 159 states and 232 transitions. [2024-10-11 13:15:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:15:38,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-11 13:15:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:38,785 INFO L225 Difference]: With dead ends: 159 [2024-10-11 13:15:38,785 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 13:15:38,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-11 13:15:38,787 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 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-11 13:15:38,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:15:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 13:15:38,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 13:15:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:15:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-10-11 13:15:38,801 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 68 [2024-10-11 13:15:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:38,802 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-10-11 13:15:38,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:15:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-10-11 13:15:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:15:38,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:38,806 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:38,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:15:38,806 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:38,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1163161521, now seen corresponding path program 1 times [2024-10-11 13:15:38,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:15:38,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260756535] [2024-10-11 13:15:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:38,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:15:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:15:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:15:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:15:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:15:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:15:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:15:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:15:38,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:15:38,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260756535] [2024-10-11 13:15:38,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260756535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:38,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:38,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:15:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678416745] [2024-10-11 13:15:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:38,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:15:38,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:15:38,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:15:38,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:15:38,986 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:15:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:39,037 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2024-10-11 13:15:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:15:39,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:15:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:39,039 INFO L225 Difference]: With dead ends: 164 [2024-10-11 13:15:39,039 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 13:15:39,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-11 13:15:39,040 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:39,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 317 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:15:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 13:15:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-10-11 13:15:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:15:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2024-10-11 13:15:39,053 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 68 [2024-10-11 13:15:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:39,055 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2024-10-11 13:15:39,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:15:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2024-10-11 13:15:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:15:39,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:39,057 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:39,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:15:39,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:39,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:39,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1220419823, now seen corresponding path program 1 times [2024-10-11 13:15:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:15:39,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085114318] [2024-10-11 13:15:39,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:39,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:15:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:15:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:39,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:15:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:39,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:15:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:39,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:15:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:15:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:39,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:15:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:15:39,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:15:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085114318] [2024-10-11 13:15:39,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085114318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:39,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:39,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:15:39,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830792654] [2024-10-11 13:15:39,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:39,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:15:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:15:39,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:15:39,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:15:39,202 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:15:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:39,227 INFO L93 Difference]: Finished difference Result 168 states and 241 transitions. [2024-10-11 13:15:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:15:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:15:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:39,229 INFO L225 Difference]: With dead ends: 168 [2024-10-11 13:15:39,229 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 13:15:39,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-11 13:15:39,230 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:39,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 321 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:15:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 13:15:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-10-11 13:15:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:15:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-10-11 13:15:39,236 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 68 [2024-10-11 13:15:39,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:39,236 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-10-11 13:15:39,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:15:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-10-11 13:15:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:15:39,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:39,238 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:39,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:15:39,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:39,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1220479405, now seen corresponding path program 1 times [2024-10-11 13:15:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:15:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850572232] [2024-10-11 13:15:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:15:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:15:39,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:15:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:15:39,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:15:39,348 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:15:39,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:15:39,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:15:39,353 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 13:15:39,390 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:15:39,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:15:39 BoogieIcfgContainer [2024-10-11 13:15:39,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:15:39,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:15:39,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:15:39,393 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:15:39,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:15:38" (3/4) ... [2024-10-11 13:15:39,395 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:15:39,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:15:39,396 INFO L158 Benchmark]: Toolchain (without parser) took 2439.57ms. Allocated memory was 184.5MB in the beginning and 291.5MB in the end (delta: 107.0MB). Free memory was 114.2MB in the beginning and 248.6MB in the end (delta: -134.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:15:39,396 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 184.5MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:15:39,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.26ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 152.4MB in the end (delta: -38.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-10-11 13:15:39,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.85ms. Allocated memory is still 184.5MB. Free memory was 152.4MB in the beginning and 149.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:15:39,397 INFO L158 Benchmark]: Boogie Preprocessor took 86.74ms. Allocated memory is still 184.5MB. Free memory was 149.1MB in the beginning and 144.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:15:39,398 INFO L158 Benchmark]: RCFGBuilder took 545.40ms. Allocated memory is still 184.5MB. Free memory was 144.0MB in the beginning and 110.2MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 13:15:39,398 INFO L158 Benchmark]: TraceAbstraction took 1359.81ms. Allocated memory was 184.5MB in the beginning and 291.5MB in the end (delta: 107.0MB). Free memory was 109.3MB in the beginning and 248.6MB in the end (delta: -139.3MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-10-11 13:15:39,398 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 291.5MB. Free memory was 248.6MB in the beginning and 248.6MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:15:39,400 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.31ms. Allocated memory is still 184.5MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.26ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 152.4MB in the end (delta: -38.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.85ms. Allocated memory is still 184.5MB. Free memory was 152.4MB in the beginning and 149.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.74ms. Allocated memory is still 184.5MB. Free memory was 149.1MB in the beginning and 144.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 545.40ms. Allocated memory is still 184.5MB. Free memory was 144.0MB in the beginning and 110.2MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1359.81ms. Allocated memory was 184.5MB in the beginning and 291.5MB in the end (delta: 107.0MB). Free memory was 109.3MB in the beginning and 248.6MB in the end (delta: -139.3MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 291.5MB. Free memory was 248.6MB in the beginning and 248.6MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L82] isInitial = 1 [L83] FCALL initially() [L84] COND TRUE 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] float_Array_0[0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] 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 [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] 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 [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] 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 [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] 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 [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] float_Array_0[1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L72] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET updateVariables() [L87] CALL step() [L37] EXPR BOOL_unsigned_char_Array_0[1] [L37] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L38] EXPR unsigned_char_Array_0[1] [L38] unsigned_char_Array_0[2] = unsigned_char_Array_0[1] [L39] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] COND TRUE BOOL_unsigned_char_Array_0[0] [L40] EXPR float_Array_0[1] [L40] float_Array_0[2] = float_Array_0[1] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L46] COND FALSE !((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) [L49] EXPR unsigned_char_Array_0[2] [L49] unsigned_short_int_Array_0[1] = unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[2] [L51] signed long int stepLocal_0 = 5 * unsigned_char_Array_0[2]; [L52] EXPR float_Array_0[1] [L52] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) [L52] EXPR float_Array_0[1] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, stepLocal_0=0, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] COND FALSE !(((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) [L59] EXPR float_Array_0[2] [L59] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] COND TRUE float_Array_0[2] < float_Array_0[1] [L60] EXPR unsigned_char_Array_0[1] [L60] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L87] RET step() [L88] CALL, EXPR property() [L78] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) [L78] EXPR float_Array_0[2] [L78] EXPR float_Array_0[1] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78-L79] return (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 1069 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 632 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 437 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:15:39,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:15:41,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:15:41,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:15:41,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:15:41,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:15:41,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:15:41,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:15:41,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:15:41,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:15:41,955 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:15:41,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:15:41,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:15:41,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:15:41,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:15:41,957 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:15:41,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:15:41,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:15:41,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:15:41,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:15:41,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:15:41,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:15:41,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:15:41,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:15:41,962 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:15:41,962 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:15:41,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:15:41,965 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:15:41,965 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:15:41,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:15:41,965 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:15:41,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:15:41,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:15:41,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:15:41,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:15:41,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:15:41,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:15:41,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:15:41,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:15:41,967 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:15:41,967 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:15:41,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:15:41,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:15:41,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:15:41,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:15:41,969 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:15:41,969 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2024-10-11 13:15:42,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:15:42,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:15:42,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:15:42,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:15:42,331 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:15:42,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-10-11 13:15:43,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:15:44,054 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:15:44,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-10-11 13:15:44,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3233b2f7c/424a2bc60b6046f1b31df5096d52bc92/FLAG2a245227a [2024-10-11 13:15:44,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3233b2f7c/424a2bc60b6046f1b31df5096d52bc92 [2024-10-11 13:15:44,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:15:44,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:15:44,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:15:44,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:15:44,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:15:44,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6cbe8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44, skipping insertion in model container [2024-10-11 13:15:44,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:15:44,254 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-29.i[916,929] [2024-10-11 13:15:44,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:15:44,328 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:15:44,339 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-29.i[916,929] [2024-10-11 13:15:44,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:15:44,395 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:15:44,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44 WrapperNode [2024-10-11 13:15:44,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:15:44,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:15:44,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:15:44,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:15:44,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,470 INFO L138 Inliner]: procedures = 33, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2024-10-11 13:15:44,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:15:44,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:15:44,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:15:44,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:15:44,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,514 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2024-10-11 13:15:44,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:15:44,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:15:44,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:15:44,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:15:44,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (1/1) ... [2024-10-11 13:15:44,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:15:44,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:15:44,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:15:44,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:15:44,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:15:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:15:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:15:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:15:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:15:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:15:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:15:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:15:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:15:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:15:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:15:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:15:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:15:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:15:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:15:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:15:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:15:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:15:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:15:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:15:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:15:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:15:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:15:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:15:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:15:44,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:15:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:15:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:15:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:15:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:15:44,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:15:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:15:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:15:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:15:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:15:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:15:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:15:44,661 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:15:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:15:44,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:15:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:15:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:15:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:15:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:15:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:15:44,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:15:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:15:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:15:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:15:44,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:15:44,815 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:15:44,817 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:15:55,932 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-11 13:15:55,932 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:15:55,980 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:15:55,982 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:15:55,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:15:55 BoogieIcfgContainer [2024-10-11 13:15:55,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:15:55,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:15:55,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:15:55,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:15:55,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:15:44" (1/3) ... [2024-10-11 13:15:55,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ab32f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:15:55, skipping insertion in model container [2024-10-11 13:15:55,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:44" (2/3) ... [2024-10-11 13:15:55,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ab32f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:15:55, skipping insertion in model container [2024-10-11 13:15:55,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:15:55" (3/3) ... [2024-10-11 13:15:55,989 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2024-10-11 13:15:56,002 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:15:56,003 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:15:56,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:15:56,090 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;@e0ee2af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:15:56,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:15:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:15:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:15:56,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:56,110 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:56,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:56,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1505659447, now seen corresponding path program 1 times [2024-10-11 13:15:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:56,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81790724] [2024-10-11 13:15:56,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:56,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:56,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:56,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:56,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:15:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:56,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:15:56,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 13:15:56,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:56,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:56,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81790724] [2024-10-11 13:15:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81790724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:56,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:56,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:15:56,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973920117] [2024-10-11 13:15:56,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:56,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:15:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:56,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:15:56,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:15:56,702 INFO L87 Difference]: Start difference. First operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:15:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:56,750 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2024-10-11 13:15:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:15:56,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-11 13:15:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:56,761 INFO L225 Difference]: With dead ends: 159 [2024-10-11 13:15:56,761 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 13:15:56,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:15:56,768 INFO L432 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:56,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:15:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 13:15:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 13:15:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 71 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:15:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-10-11 13:15:56,806 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 68 [2024-10-11 13:15:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:56,807 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-10-11 13:15:56,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:15:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-10-11 13:15:56,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:15:56,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:56,810 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:56,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:15:57,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:57,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:57,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:57,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2039180527, now seen corresponding path program 1 times [2024-10-11 13:15:57,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:57,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551924659] [2024-10-11 13:15:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:57,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:57,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:57,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:57,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:15:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:57,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:15:57,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 13:15:57,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:57,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:57,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551924659] [2024-10-11 13:15:57,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551924659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:57,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:57,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:15:57,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879650954] [2024-10-11 13:15:57,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:57,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:15:57,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:57,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:15:57,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:15:57,356 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:15:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:57,449 INFO L93 Difference]: Finished difference Result 159 states and 232 transitions. [2024-10-11 13:15:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:15:57,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-11 13:15:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:57,450 INFO L225 Difference]: With dead ends: 159 [2024-10-11 13:15:57,450 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 13:15:57,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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-11 13:15:57,452 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 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-11 13:15:57,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:15:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 13:15:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 13:15:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:15:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-10-11 13:15:57,458 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 68 [2024-10-11 13:15:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:57,459 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-10-11 13:15:57,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:15:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-10-11 13:15:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:15:57,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:57,461 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:57,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:15:57,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:57,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:57,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1163161521, now seen corresponding path program 1 times [2024-10-11 13:15:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:57,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858673430] [2024-10-11 13:15:57,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:57,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:57,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:57,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:57,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:15:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:57,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:15:57,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:15:58,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:58,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:58,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858673430] [2024-10-11 13:15:58,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858673430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:58,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:58,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:15:58,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386999587] [2024-10-11 13:15:58,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:58,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:15:58,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:58,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:15:58,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:15:58,021 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:15:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:58,139 INFO L93 Difference]: Finished difference Result 168 states and 243 transitions. [2024-10-11 13:15:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:15:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:15:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:58,141 INFO L225 Difference]: With dead ends: 168 [2024-10-11 13:15:58,141 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 13:15:58,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:15:58,144 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:58,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 507 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:15:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 13:15:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-10-11 13:15:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:15:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-10-11 13:15:58,154 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 68 [2024-10-11 13:15:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:58,154 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-10-11 13:15:58,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:15:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-10-11 13:15:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:15:58,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:58,156 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:58,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 13:15:58,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:58,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:58,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:58,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1220419823, now seen corresponding path program 1 times [2024-10-11 13:15:58,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:58,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934512255] [2024-10-11 13:15:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:58,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:58,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:58,361 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:58,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 13:15:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:58,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:15:58,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:15:58,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:58,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:58,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934512255] [2024-10-11 13:15:58,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934512255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:58,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:58,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:15:58,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974084930] [2024-10-11 13:15:58,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:58,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:15:58,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:58,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:15:58,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:15:58,666 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:15:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:58,841 INFO L93 Difference]: Finished difference Result 176 states and 249 transitions. [2024-10-11 13:15:58,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:15:58,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:15:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:58,850 INFO L225 Difference]: With dead ends: 176 [2024-10-11 13:15:58,850 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 13:15:58,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:15:58,851 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:58,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 603 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:15:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 13:15:58,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-10-11 13:15:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:15:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2024-10-11 13:15:58,870 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 68 [2024-10-11 13:15:58,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:58,870 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2024-10-11 13:15:58,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:15:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-10-11 13:15:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:15:58,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:58,871 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:58,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 13:15:59,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:59,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:59,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1220479405, now seen corresponding path program 1 times [2024-10-11 13:15:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:59,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724239877] [2024-10-11 13:15:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:59,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:59,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:59,078 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:59,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 13:15:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:59,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:15:59,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:16:00,012 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 131 treesize of output 67 [2024-10-11 13:16:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:16:00,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:16:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:16:00,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:16:00,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724239877] [2024-10-11 13:16:00,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724239877] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:16:00,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:16:00,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-10-11 13:16:00,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186337596] [2024-10-11 13:16:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:16:00,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:16:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:16:00,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:16:00,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:16:00,469 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:16:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:16:01,184 INFO L93 Difference]: Finished difference Result 250 states and 349 transitions. [2024-10-11 13:16:01,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:16:01,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:16:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:16:01,187 INFO L225 Difference]: With dead ends: 250 [2024-10-11 13:16:01,187 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 13:16:01,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:16:01,188 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 161 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:16:01,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 285 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:16:01,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 13:16:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2024-10-11 13:16:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 147 states have (on average 1.3877551020408163) internal successors, (204), 148 states have internal predecessors, (204), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:16:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 222 transitions. [2024-10-11 13:16:01,202 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 222 transitions. Word has length 68 [2024-10-11 13:16:01,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:16:01,202 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 222 transitions. [2024-10-11 13:16:01,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:16:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 222 transitions. [2024-10-11 13:16:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:16:01,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:16:01,203 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:16:01,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 13:16:01,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:16:01,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:16:01,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:16:01,406 INFO L85 PathProgramCache]: Analyzing trace with hash 199411051, now seen corresponding path program 1 times [2024-10-11 13:16:01,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:16:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433824843] [2024-10-11 13:16:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:16:01,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:16:01,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:16:01,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:16:01,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 13:16:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:16:01,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 13:16:01,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:16:01,898 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-11 13:16:02,909 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 131 treesize of output 67 [2024-10-11 13:16:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:16:03,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:16:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:16:03,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:16:03,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433824843] [2024-10-11 13:16:03,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433824843] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:16:03,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:16:03,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-10-11 13:16:03,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891182369] [2024-10-11 13:16:03,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:16:03,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:16:03,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:16:03,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:16:03,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:16:03,674 INFO L87 Difference]: Start difference. First operand 159 states and 222 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:16:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:16:04,743 INFO L93 Difference]: Finished difference Result 408 states and 565 transitions. [2024-10-11 13:16:04,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:16:04,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:16:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:16:04,746 INFO L225 Difference]: With dead ends: 408 [2024-10-11 13:16:04,747 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 13:16:04,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:16:04,748 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 109 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:16:04,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 396 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:16:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 13:16:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 159. [2024-10-11 13:16:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 147 states have (on average 1.380952380952381) internal successors, (203), 148 states have internal predecessors, (203), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:16:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2024-10-11 13:16:04,757 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 68 [2024-10-11 13:16:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:16:04,757 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2024-10-11 13:16:04,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:16:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2024-10-11 13:16:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:16:04,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:16:04,759 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:16:04,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 13:16:04,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:16:04,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:16:04,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:16:04,977 INFO L85 PathProgramCache]: Analyzing trace with hash -618237399, now seen corresponding path program 1 times [2024-10-11 13:16:04,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:16:04,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78097256] [2024-10-11 13:16:04,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:16:04,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:16:04,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:16:04,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:16:04,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 13:16:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:16:05,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 13:16:05,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:16:05,608 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 131 treesize of output 67 [2024-10-11 13:16:05,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:16:05,802 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 166 treesize of output 58 [2024-10-11 13:16:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:16:05,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:16:06,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:16:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78097256] [2024-10-11 13:16:06,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78097256] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:16:06,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [915555278] [2024-10-11 13:16:06,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:16:06,203 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:16:06,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:16:06,210 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:16:06,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-11 13:16:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:16:06,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:16:06,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:16:07,497 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 101 treesize of output 55 [2024-10-11 13:16:07,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:16:07,671 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 136 treesize of output 46 [2024-10-11 13:16:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:16:07,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:16:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [915555278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:16:07,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:16:07,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-10-11 13:16:07,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773320135] [2024-10-11 13:16:07,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:16:07,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:16:07,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:16:07,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:16:07,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:16:07,877 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 13:16:11,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:14,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:18,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:21,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:24,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:27,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:29,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:31,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:33,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:36,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:38,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:41,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:16:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:16:41,542 INFO L93 Difference]: Finished difference Result 539 states and 746 transitions. [2024-10-11 13:16:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:16:41,543 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 68 [2024-10-11 13:16:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:16:41,545 INFO L225 Difference]: With dead ends: 539 [2024-10-11 13:16:41,545 INFO L226 Difference]: Without dead ends: 381 [2024-10-11 13:16:41,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:16:41,550 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 711 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:16:41,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 626 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 33.1s Time] [2024-10-11 13:16:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-11 13:16:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 249. [2024-10-11 13:16:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 230 states have (on average 1.382608695652174) internal successors, (318), 232 states have internal predecessors, (318), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:16:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 348 transitions. [2024-10-11 13:16:41,589 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 348 transitions. Word has length 68 [2024-10-11 13:16:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:16:41,590 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 348 transitions. [2024-10-11 13:16:41,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 13:16:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 348 transitions. [2024-10-11 13:16:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:16:41,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:16:41,592 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:16:41,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 13:16:41,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-11 13:16:41,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:16:41,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:16:41,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:16:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash 275248939, now seen corresponding path program 1 times [2024-10-11 13:16:42,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:16:42,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874836151] [2024-10-11 13:16:42,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:16:42,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:16:42,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:16:42,003 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:16:42,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 13:16:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:16:42,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:16:42,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:16:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:16:42,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:16:42,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:16:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874836151] [2024-10-11 13:16:42,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874836151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:16:42,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:16:42,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:16:42,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574938889] [2024-10-11 13:16:42,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:16:42,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:16:42,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:16:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:16:42,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:16:42,326 INFO L87 Difference]: Start difference. First operand 249 states and 348 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:16:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:16:42,457 INFO L93 Difference]: Finished difference Result 497 states and 695 transitions. [2024-10-11 13:16:42,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:16:42,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-11 13:16:42,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:16:42,464 INFO L225 Difference]: With dead ends: 497 [2024-10-11 13:16:42,464 INFO L226 Difference]: Without dead ends: 249 [2024-10-11 13:16:42,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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-11 13:16:42,465 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:16:42,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:16:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-11 13:16:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2024-10-11 13:16:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 230 states have (on average 1.3782608695652174) internal successors, (317), 232 states have internal predecessors, (317), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:16:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 347 transitions. [2024-10-11 13:16:42,482 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 347 transitions. Word has length 68 [2024-10-11 13:16:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:16:42,482 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 347 transitions. [2024-10-11 13:16:42,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:16:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2024-10-11 13:16:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 13:16:42,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:16:42,485 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:16:42,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 13:16:42,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:16:42,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:16:42,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:16:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2122546504, now seen corresponding path program 1 times [2024-10-11 13:16:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:16:42,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146757185] [2024-10-11 13:16:42,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:16:42,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:16:42,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:16:42,690 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:16:42,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 13:16:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:16:43,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 13:16:43,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:16:43,154 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-11 13:16:43,546 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 131 treesize of output 67 [2024-10-11 13:16:44,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:16:44,235 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 224 treesize of output 80 [2024-10-11 13:16:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:16:44,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:16:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:16:45,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:16:45,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146757185] [2024-10-11 13:16:45,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146757185] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:16:45,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:16:45,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-10-11 13:16:45,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847883994] [2024-10-11 13:16:45,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:16:45,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:16:45,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:16:45,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:16:45,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:16:45,404 INFO L87 Difference]: Start difference. First operand 249 states and 347 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:16:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:16:48,424 INFO L93 Difference]: Finished difference Result 647 states and 892 transitions. [2024-10-11 13:16:48,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:16:48,425 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2024-10-11 13:16:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:16:48,427 INFO L225 Difference]: With dead ends: 647 [2024-10-11 13:16:48,427 INFO L226 Difference]: Without dead ends: 399 [2024-10-11 13:16:48,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:16:48,429 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 360 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:16:48,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 834 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 13:16:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-11 13:16:48,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 259. [2024-10-11 13:16:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 240 states have (on average 1.3791666666666667) internal successors, (331), 242 states have internal predecessors, (331), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:16:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 361 transitions. [2024-10-11 13:16:48,437 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 361 transitions. Word has length 69 [2024-10-11 13:16:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:16:48,438 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 361 transitions. [2024-10-11 13:16:48,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:16:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 361 transitions. [2024-10-11 13:16:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 13:16:48,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:16:48,439 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:16:48,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 13:16:48,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:16:48,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:16:48,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:16:48,644 INFO L85 PathProgramCache]: Analyzing trace with hash 296597195, now seen corresponding path program 1 times [2024-10-11 13:16:48,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:16:48,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761403482] [2024-10-11 13:16:48,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:16:48,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:16:48,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:16:48,647 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:16:48,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 13:16:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:16:48,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 13:16:48,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:16:49,465 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 35 treesize of output 17 [2024-10-11 13:16:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:16:49,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:16:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 13:16:50,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:16:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761403482] [2024-10-11 13:16:50,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761403482] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:16:50,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:16:50,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-10-11 13:16:50,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386918672] [2024-10-11 13:16:50,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:16:50,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:16:50,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:16:50,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:16:50,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:16:50,182 INFO L87 Difference]: Start difference. First operand 259 states and 361 transitions. Second operand has 16 states, 12 states have (on average 5.666666666666667) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 13:16:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:16:50,861 INFO L93 Difference]: Finished difference Result 387 states and 524 transitions. [2024-10-11 13:16:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:16:50,862 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 5.666666666666667) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 69 [2024-10-11 13:16:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:16:50,863 INFO L225 Difference]: With dead ends: 387 [2024-10-11 13:16:50,863 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 13:16:50,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:16:50,864 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 157 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:16:50,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 814 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:16:50,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 13:16:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2024-10-11 13:16:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 110 states have internal predecessors, (140), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 13:16:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 158 transitions. [2024-10-11 13:16:50,875 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 158 transitions. Word has length 69 [2024-10-11 13:16:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:16:50,875 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 158 transitions. [2024-10-11 13:16:50,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 5.666666666666667) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 13:16:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 158 transitions. [2024-10-11 13:16:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:16:50,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:16:50,876 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:16:50,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 13:16:51,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:16:51,077 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:16:51,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:16:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash -73770449, now seen corresponding path program 1 times [2024-10-11 13:16:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:16:51,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889655331] [2024-10-11 13:16:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:16:51,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:16:51,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:16:51,081 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:16:51,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 13:16:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:16:51,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:16:51,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:16:52,077 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 129 treesize of output 65 [2024-10-11 13:16:52,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:16:52,376 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 164 treesize of output 56 [2024-10-11 13:16:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 13:16:52,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:16:52,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:16:52,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889655331] [2024-10-11 13:16:52,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889655331] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:16:52,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1251346822] [2024-10-11 13:16:52,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:16:52,758 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:16:52,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:16:52,760 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:16:52,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-10-11 13:16:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:16:53,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:16:53,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:16:53,907 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 100 treesize of output 54 [2024-10-11 13:16:54,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:16:54,121 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 135 treesize of output 45 [2024-10-11 13:16:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 13:16:54,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:16:54,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1251346822] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:16:54,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:16:54,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2024-10-11 13:16:54,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404437707] [2024-10-11 13:16:54,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:16:54,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 13:16:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:16:54,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 13:16:54,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:16:54,300 INFO L87 Difference]: Start difference. First operand 125 states and 158 transitions. Second operand has 21 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 13:16:57,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:17:00,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:17:03,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:17:08,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:17:11,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:17:17,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []