./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:35:16,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:35:16,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:35:16,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:35:16,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:35:16,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:35:16,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:35:16,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:35:16,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:35:16,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:35:16,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:35:16,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:35:16,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:35:16,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:35:16,420 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:35:16,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:35:16,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:35:16,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:35:16,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:35:16,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:35:16,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:35:16,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:35:16,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:35:16,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:35:16,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:35:16,426 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:35:16,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:35:16,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:35:16,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:35:16,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:35:16,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:35:16,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:35:16,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:16,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:35:16,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:35:16,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:35:16,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:35:16,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:35:16,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:35:16,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:35:16,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:35:16,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:35:16,430 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 [2024-11-19 00:35:16,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:35:16,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:35:16,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:35:16,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:35:16,746 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:35:16,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2024-11-19 00:35:18,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:35:18,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:35:18,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2024-11-19 00:35:18,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a24be33/76a0e31911f545ee8e4a2613b6771a6a/FLAG042ecf992 [2024-11-19 00:35:18,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a24be33/76a0e31911f545ee8e4a2613b6771a6a [2024-11-19 00:35:18,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:35:18,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:35:18,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:18,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:35:18,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:35:18,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:18,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e51470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18, skipping insertion in model container [2024-11-19 00:35:18,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:18,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:35:18,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2024-11-19 00:35:18,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:18,768 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:35:18,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2024-11-19 00:35:18,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:18,851 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:35:18,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18 WrapperNode [2024-11-19 00:35:18,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:18,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:18,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:35:18,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:35:18,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:18,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:18,923 INFO L138 Inliner]: procedures = 29, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-11-19 00:35:18,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:18,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:35:18,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:35:18,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:35:18,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:18,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:18,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:18,972 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 40, 21, 9, 43]. 37 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 6, 2, 1, 2]. The 15 writes are split as follows [0, 9, 2, 2, 2]. [2024-11-19 00:35:18,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:18,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:19,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:19,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:19,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:19,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:19,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:35:19,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:35:19,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:35:19,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:35:19,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (1/1) ... [2024-11-19 00:35:19,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:19,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:19,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:35:19,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:35:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:35:19,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:35:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:35:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:35:19,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:35:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:35:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:35:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:35:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:35:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:35:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:35:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:35:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:35:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:35:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:35:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:35:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:35:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:35:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:35:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:35:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:35:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:35:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:35:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:35:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:35:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:35:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:35:19,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:35:19,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:35:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:35:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:35:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:35:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:35:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:35:19,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:35:19,265 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:35:19,267 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:35:19,780 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-19 00:35:19,780 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:35:19,805 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:35:19,805 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:35:19,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:19 BoogieIcfgContainer [2024-11-19 00:35:19,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:35:19,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:35:19,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:35:19,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:35:19,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:35:18" (1/3) ... [2024-11-19 00:35:19,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b81ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:19, skipping insertion in model container [2024-11-19 00:35:19,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:18" (2/3) ... [2024-11-19 00:35:19,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b81ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:19, skipping insertion in model container [2024-11-19 00:35:19,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:19" (3/3) ... [2024-11-19 00:35:19,814 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-42.i [2024-11-19 00:35:19,834 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:35:19,834 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:35:19,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:35:19,894 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;@596257d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:35:19,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:35:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:35:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:19,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:19,908 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:19,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:19,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:19,913 INFO L85 PathProgramCache]: Analyzing trace with hash 437609435, now seen corresponding path program 1 times [2024-11-19 00:35:19,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:19,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063692944] [2024-11-19 00:35:19,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:19,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-19 00:35:20,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:20,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063692944] [2024-11-19 00:35:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063692944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:20,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399366443] [2024-11-19 00:35:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:20,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:20,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:20,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:35:20,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:35:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:20,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:35:20,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-19 00:35:20,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:20,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399366443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:20,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:35:20,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:35:20,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75918664] [2024-11-19 00:35:20,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:20,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:35:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:20,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:35:20,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:20,663 INFO L87 Difference]: Start difference. First operand has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:35:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:20,691 INFO L93 Difference]: Finished difference Result 193 states and 293 transitions. [2024-11-19 00:35:20,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:35:20,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-11-19 00:35:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:20,700 INFO L225 Difference]: With dead ends: 193 [2024-11-19 00:35:20,700 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 00:35:20,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:20,706 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:20,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 00:35:20,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 00:35:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:35:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-11-19 00:35:20,745 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103 [2024-11-19 00:35:20,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:20,746 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-11-19 00:35:20,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:35:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-11-19 00:35:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:20,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:20,749 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:20,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:35:20,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:35:20,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:20,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash -383646895, now seen corresponding path program 1 times [2024-11-19 00:35:20,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:20,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611106501] [2024-11-19 00:35:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:20,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:35:21,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:21,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611106501] [2024-11-19 00:35:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611106501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:21,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:21,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:35:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983116366] [2024-11-19 00:35:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:21,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:35:21,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:21,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:35:21,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:21,744 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:21,828 INFO L93 Difference]: Finished difference Result 189 states and 267 transitions. [2024-11-19 00:35:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:35:21,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-19 00:35:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:21,831 INFO L225 Difference]: With dead ends: 189 [2024-11-19 00:35:21,831 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 00:35:21,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:21,833 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:21,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:35:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 00:35:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 00:35:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:35:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-11-19 00:35:21,843 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 103 [2024-11-19 00:35:21,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:21,844 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-11-19 00:35:21,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-11-19 00:35:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:21,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:21,846 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:21,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:35:21,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:21,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:21,847 INFO L85 PathProgramCache]: Analyzing trace with hash -243098285, now seen corresponding path program 1 times [2024-11-19 00:35:21,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:21,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108656293] [2024-11-19 00:35:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:21,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:35:22,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:22,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108656293] [2024-11-19 00:35:22,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108656293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:22,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:22,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:35:22,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809342793] [2024-11-19 00:35:22,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:22,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:35:22,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:22,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:35:22,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:35:22,529 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:22,622 INFO L93 Difference]: Finished difference Result 189 states and 265 transitions. [2024-11-19 00:35:22,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:35:22,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-19 00:35:22,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:22,627 INFO L225 Difference]: With dead ends: 189 [2024-11-19 00:35:22,627 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 00:35:22,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:35:22,629 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:22,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 473 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:35:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 00:35:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 00:35:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:35:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2024-11-19 00:35:22,649 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 103 [2024-11-19 00:35:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:22,651 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2024-11-19 00:35:22,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2024-11-19 00:35:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:22,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:22,656 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:22,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:35:22,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:22,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1254215535, now seen corresponding path program 1 times [2024-11-19 00:35:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:22,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524241571] [2024-11-19 00:35:22,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:22,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:35:23,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:23,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524241571] [2024-11-19 00:35:23,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524241571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:23,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:23,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:35:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103251205] [2024-11-19 00:35:23,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:23,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:35:23,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:23,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:35:23,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:23,488 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:23,706 INFO L93 Difference]: Finished difference Result 220 states and 306 transitions. [2024-11-19 00:35:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:35:23,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-19 00:35:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:23,708 INFO L225 Difference]: With dead ends: 220 [2024-11-19 00:35:23,711 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 00:35:23,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:35:23,713 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 107 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:23,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 619 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:35:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 00:35:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-19 00:35:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 104 states have internal predecessors, (134), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:35:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 174 transitions. [2024-11-19 00:35:23,738 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 174 transitions. Word has length 103 [2024-11-19 00:35:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:23,739 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 174 transitions. [2024-11-19 00:35:23,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 174 transitions. [2024-11-19 00:35:23,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:23,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:23,740 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:23,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:35:23,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:23,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash -553150957, now seen corresponding path program 1 times [2024-11-19 00:35:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:23,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766316454] [2024-11-19 00:35:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:35:24,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:24,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766316454] [2024-11-19 00:35:24,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766316454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:24,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886221730] [2024-11-19 00:35:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:24,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:24,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:24,542 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:35:24,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:35:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:24,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:35:24,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:24,822 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 31 treesize of output 15 [2024-11-19 00:35:24,862 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 31 treesize of output 15 [2024-11-19 00:35:24,902 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 31 treesize of output 15 [2024-11-19 00:35:25,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:25,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2024-11-19 00:35:25,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:25,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 26 [2024-11-19 00:35:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 00:35:25,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:35:25,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886221730] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:35:25,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:35:25,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 11 [2024-11-19 00:35:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907576676] [2024-11-19 00:35:25,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:35:25,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:35:25,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:25,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:35:25,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:35:25,362 INFO L87 Difference]: Start difference. First operand 126 states and 174 transitions. Second operand has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-19 00:35:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:25,687 INFO L93 Difference]: Finished difference Result 293 states and 394 transitions. [2024-11-19 00:35:25,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:35:25,688 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 103 [2024-11-19 00:35:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:25,691 INFO L225 Difference]: With dead ends: 293 [2024-11-19 00:35:25,691 INFO L226 Difference]: Without dead ends: 194 [2024-11-19 00:35:25,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 203 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:35:25,693 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 296 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:25,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 521 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:35:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-19 00:35:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 134. [2024-11-19 00:35:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.275229357798165) internal successors, (139), 110 states have internal predecessors, (139), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:35:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2024-11-19 00:35:25,718 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 103 [2024-11-19 00:35:25,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:25,719 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2024-11-19 00:35:25,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-19 00:35:25,721 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2024-11-19 00:35:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:25,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:25,722 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:25,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:35:25,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:25,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:25,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1636712826, now seen corresponding path program 1 times [2024-11-19 00:35:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:25,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024542988] [2024-11-19 00:35:25,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:25,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:35:26,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:26,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024542988] [2024-11-19 00:35:26,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024542988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:26,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:26,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:35:26,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680452332] [2024-11-19 00:35:26,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:26,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:35:26,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:26,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:35:26,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:26,332 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:26,445 INFO L93 Difference]: Finished difference Result 340 states and 453 transitions. [2024-11-19 00:35:26,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:35:26,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-19 00:35:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:26,447 INFO L225 Difference]: With dead ends: 340 [2024-11-19 00:35:26,448 INFO L226 Difference]: Without dead ends: 237 [2024-11-19 00:35:26,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:35:26,449 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 124 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:26,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 581 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:35:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-19 00:35:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 226. [2024-11-19 00:35:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 187 states have (on average 1.2834224598930482) internal successors, (240), 189 states have internal predecessors, (240), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-19 00:35:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 302 transitions. [2024-11-19 00:35:26,483 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 302 transitions. Word has length 103 [2024-11-19 00:35:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:26,483 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 302 transitions. [2024-11-19 00:35:26,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 302 transitions. [2024-11-19 00:35:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:26,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:26,485 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:26,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:35:26,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:26,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash -664109764, now seen corresponding path program 1 times [2024-11-19 00:35:26,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141126836] [2024-11-19 00:35:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:35:27,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:27,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141126836] [2024-11-19 00:35:27,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141126836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:27,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:27,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:35:27,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140140293] [2024-11-19 00:35:27,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:27,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:35:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:27,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:35:27,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:35:27,240 INFO L87 Difference]: Start difference. First operand 226 states and 302 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:27,422 INFO L93 Difference]: Finished difference Result 442 states and 587 transitions. [2024-11-19 00:35:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:35:27,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-19 00:35:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:27,425 INFO L225 Difference]: With dead ends: 442 [2024-11-19 00:35:27,425 INFO L226 Difference]: Without dead ends: 247 [2024-11-19 00:35:27,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:35:27,426 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 120 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:27,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1121 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:35:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-19 00:35:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 162. [2024-11-19 00:35:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 135 states have internal predecessors, (170), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:35:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 214 transitions. [2024-11-19 00:35:27,442 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 214 transitions. Word has length 103 [2024-11-19 00:35:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:27,442 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 214 transitions. [2024-11-19 00:35:27,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 214 transitions. [2024-11-19 00:35:27,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:27,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:27,444 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:27,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:35:27,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:27,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:27,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1735336811, now seen corresponding path program 1 times [2024-11-19 00:35:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:27,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4368401] [2024-11-19 00:35:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:35:27,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:27,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4368401] [2024-11-19 00:35:27,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4368401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:27,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:27,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:35:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489841151] [2024-11-19 00:35:27,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:27,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:35:27,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:35:27,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:27,636 INFO L87 Difference]: Start difference. First operand 162 states and 214 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:27,679 INFO L93 Difference]: Finished difference Result 283 states and 374 transitions. [2024-11-19 00:35:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:35:27,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-19 00:35:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:27,681 INFO L225 Difference]: With dead ends: 283 [2024-11-19 00:35:27,681 INFO L226 Difference]: Without dead ends: 160 [2024-11-19 00:35:27,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:35:27,682 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:27,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:27,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-19 00:35:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-19 00:35:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 132 states have (on average 1.25) internal successors, (165), 133 states have internal predecessors, (165), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:35:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2024-11-19 00:35:27,699 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 103 [2024-11-19 00:35:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:27,699 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2024-11-19 00:35:27,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2024-11-19 00:35:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:27,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:27,700 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:27,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:35:27,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:27,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:27,703 INFO L85 PathProgramCache]: Analyzing trace with hash -959905663, now seen corresponding path program 1 times [2024-11-19 00:35:27,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:27,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743885920] [2024-11-19 00:35:27,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:27,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:35:27,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:27,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743885920] [2024-11-19 00:35:27,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743885920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:27,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:27,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:35:27,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465672510] [2024-11-19 00:35:27,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:27,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:35:27,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:35:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:35:27,832 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:27,850 INFO L93 Difference]: Finished difference Result 257 states and 334 transitions. [2024-11-19 00:35:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:35:27,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-19 00:35:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:27,855 INFO L225 Difference]: With dead ends: 257 [2024-11-19 00:35:27,855 INFO L226 Difference]: Without dead ends: 136 [2024-11-19 00:35:27,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:35:27,857 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:27,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:27,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-19 00:35:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-19 00:35:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 108 states have (on average 1.212962962962963) internal successors, (131), 109 states have internal predecessors, (131), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:35:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 175 transitions. [2024-11-19 00:35:27,872 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 175 transitions. Word has length 103 [2024-11-19 00:35:27,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:27,872 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 175 transitions. [2024-11-19 00:35:27,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 175 transitions. [2024-11-19 00:35:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:35:27,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:27,874 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:27,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:35:27,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:27,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:27,875 INFO L85 PathProgramCache]: Analyzing trace with hash 746523829, now seen corresponding path program 1 times [2024-11-19 00:35:27,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:27,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638818645] [2024-11-19 00:35:27,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:27,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:35:27,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:35:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:35:28,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:35:28,080 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:35:28,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:35:28,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:35:28,085 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:28,175 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:35:28,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:35:28 BoogieIcfgContainer [2024-11-19 00:35:28,180 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:35:28,180 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:35:28,180 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:35:28,181 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:35:28,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:19" (3/4) ... [2024-11-19 00:35:28,184 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:35:28,185 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:35:28,185 INFO L158 Benchmark]: Toolchain (without parser) took 9777.05ms. Allocated memory was 161.5MB in the beginning and 318.8MB in the end (delta: 157.3MB). Free memory was 91.3MB in the beginning and 236.6MB in the end (delta: -145.2MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-19 00:35:28,186 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:35:28,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.76ms. Allocated memory is still 161.5MB. Free memory was 91.0MB in the beginning and 124.1MB in the end (delta: -33.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 00:35:28,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.25ms. Allocated memory is still 161.5MB. Free memory was 124.1MB in the beginning and 119.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:35:28,187 INFO L158 Benchmark]: Boogie Preprocessor took 107.69ms. Allocated memory is still 161.5MB. Free memory was 119.9MB in the beginning and 115.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:35:28,187 INFO L158 Benchmark]: RCFGBuilder took 773.77ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 80.7MB in the end (delta: 34.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 00:35:28,187 INFO L158 Benchmark]: TraceAbstraction took 8371.94ms. Allocated memory was 161.5MB in the beginning and 318.8MB in the end (delta: 157.3MB). Free memory was 80.1MB in the beginning and 236.6MB in the end (delta: -156.5MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2024-11-19 00:35:28,188 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 318.8MB. Free memory is still 236.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:35:28,189 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.76ms. Allocated memory is still 161.5MB. Free memory was 91.0MB in the beginning and 124.1MB in the end (delta: -33.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.25ms. Allocated memory is still 161.5MB. Free memory was 124.1MB in the beginning and 119.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.69ms. Allocated memory is still 161.5MB. Free memory was 119.9MB in the beginning and 115.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 773.77ms. Allocated memory is still 161.5MB. Free memory was 115.1MB in the beginning and 80.7MB in the end (delta: 34.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8371.94ms. Allocated memory was 161.5MB in the beginning and 318.8MB in the end (delta: 157.3MB). Free memory was 80.1MB in the beginning and 236.6MB in the end (delta: -156.5MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 318.8MB. Free memory is still 236.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -1 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] FCALL updateLastVariables() [L91] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] float_Array_0[1] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[1] [L75] 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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L75] EXPR float_Array_0[1] [L75] 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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] 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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] 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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] 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, signed_long_int_Array_0={6:0}, unsigned_char_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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] 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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L77] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_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, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] RET updateVariables() [L92] CALL step() [L37] EXPR unsigned_char_Array_0[0] [L37] unsigned_char_Array_0[1] = (unsigned_char_Array_0[0] + 100) [L38] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) [L38] EXPR float_Array_0[1] [L38] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] float_Array_0[0] = ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))) [L39] EXPR unsigned_char_Array_0[1] [L39] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] COND FALSE !(unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L42] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L42] signed_long_int_Array_0[0] = (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))) [L44] EXPR float_Array_0[1] [L44] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L44] COND TRUE float_Array_0[1] <= float_Array_0[0] [L45] EXPR signed_long_int_Array_0[0] [L45] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L45] COND TRUE signed_long_int_Array_0[0] != unsigned_char_Array_0[1] [L46] EXPR BOOL_unsigned_char_Array_0[1][2] [L46] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][2] [L55] EXPR float_Array_0[0] [L55] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L55] COND FALSE !((- float_Array_0[0]) > float_Array_0[1]) [L58] EXPR signed_long_int_Array_0[0] [L58] EXPR unsigned_char_Array_0[0] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] [L58] EXPR BOOL_unsigned_char_Array_0[0][1] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L58] BOOL_unsigned_char_Array_0[0][0] = ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]) [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))))) [L83] EXPR signed_long_int_Array_0[0] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[0] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) [L83] EXPR float_Array_0[1] [L83] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83-L84] return (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 648 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 647 mSDsluCounter, 4411 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3230 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 729 IncrementalHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1181 mSDtfsCounter, 729 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 328 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=6, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 157 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1238 NumberOfCodeBlocks, 1238 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1224 ConstructedInterpolants, 0 QuantifiedInterpolants, 3254 SizeOfPredicates, 5 NumberOfNonLiveVariables, 779 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 2539/2640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:35:28,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:35:30,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:35:30,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:35:30,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:35:30,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:35:30,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:35:30,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:35:30,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:35:30,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:35:30,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:35:30,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:35:30,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:35:30,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:35:30,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:35:30,579 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:35:30,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:35:30,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:35:30,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:35:30,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:35:30,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:35:30,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:35:30,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:35:30,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:35:30,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:35:30,587 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:35:30,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:35:30,587 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:35:30,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:35:30,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:35:30,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:35:30,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:35:30,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:35:30,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:35:30,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:35:30,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:30,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:35:30,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:35:30,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:35:30,591 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:35:30,591 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:35:30,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:35:30,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:35:30,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:35:30,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:35:30,593 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 [2024-11-19 00:35:30,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:35:30,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:35:30,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:35:30,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:35:30,951 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:35:30,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2024-11-19 00:35:32,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:35:32,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:35:32,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2024-11-19 00:35:32,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c935cd1/0af1baa227ae468da780c516b2e7d6bd/FLAG117ff69e1 [2024-11-19 00:35:32,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c935cd1/0af1baa227ae468da780c516b2e7d6bd [2024-11-19 00:35:32,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:35:32,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:35:32,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:32,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:35:32,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:35:32,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:32" (1/1) ... [2024-11-19 00:35:32,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60444e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:32, skipping insertion in model container [2024-11-19 00:35:32,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:32" (1/1) ... [2024-11-19 00:35:32,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:35:33,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2024-11-19 00:35:33,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:33,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:35:33,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i[916,929] [2024-11-19 00:35:33,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:33,291 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:35:33,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33 WrapperNode [2024-11-19 00:35:33,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:33,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:33,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:35:33,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:35:33,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,360 INFO L138 Inliner]: procedures = 33, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-11-19 00:35:33,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:33,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:35:33,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:35:33,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:35:33,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,419 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 40, 21, 9, 43]. 37 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 6, 2, 1, 2]. The 15 writes are split as follows [0, 9, 2, 2, 2]. [2024-11-19 00:35:33,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:35:33,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:35:33,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:35:33,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:35:33,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (1/1) ... [2024-11-19 00:35:33,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:33,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:33,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:35:33,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:35:33,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:35:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:35:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:35:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:35:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:35:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:35:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:35:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:35:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:35:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:35:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:35:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:35:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:35:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:35:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:35:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:35:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:35:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:35:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:35:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:35:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:35:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:35:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:35:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:35:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:35:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:35:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:35:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:35:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:35:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:35:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:35:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:35:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:35:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:35:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:35:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:35:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:35:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:35:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:35:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:35:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:35:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:35:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:35:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:35:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:35:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:35:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:35:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:35:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:35:33,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:35:33,724 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:35:33,730 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:35:34,320 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-19 00:35:34,321 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:35:34,336 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:35:34,337 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:35:34,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:34 BoogieIcfgContainer [2024-11-19 00:35:34,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:35:34,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:35:34,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:35:34,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:35:34,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:35:32" (1/3) ... [2024-11-19 00:35:34,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5962b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:34, skipping insertion in model container [2024-11-19 00:35:34,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:33" (2/3) ... [2024-11-19 00:35:34,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5962b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:34, skipping insertion in model container [2024-11-19 00:35:34,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:34" (3/3) ... [2024-11-19 00:35:34,346 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-42.i [2024-11-19 00:35:34,363 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:35:34,363 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:35:34,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:35:34,434 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;@2977d0ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:35:34,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:35:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:35:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:34,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:34,450 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:34,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:34,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash 437609435, now seen corresponding path program 1 times [2024-11-19 00:35:34,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:34,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080573672] [2024-11-19 00:35:34,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:34,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:34,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:34,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:34,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:35:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:34,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:35:34,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-19 00:35:34,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:34,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:34,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080573672] [2024-11-19 00:35:34,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080573672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:34,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:34,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:35:34,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47775583] [2024-11-19 00:35:34,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:34,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:35:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:34,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:35:34,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:34,867 INFO L87 Difference]: Start difference. First operand has 100 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:34,903 INFO L93 Difference]: Finished difference Result 193 states and 293 transitions. [2024-11-19 00:35:34,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:35:34,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-19 00:35:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:34,912 INFO L225 Difference]: With dead ends: 193 [2024-11-19 00:35:34,912 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 00:35:34,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:34,918 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:34,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 00:35:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 00:35:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:35:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-11-19 00:35:34,957 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103 [2024-11-19 00:35:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:34,957 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-11-19 00:35:34,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:35:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-11-19 00:35:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:34,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:34,960 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:34,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 00:35:35,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:35,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:35,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -383646895, now seen corresponding path program 1 times [2024-11-19 00:35:35,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:35,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644404673] [2024-11-19 00:35:35,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:35,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:35,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:35,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:35,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:35:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:35,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:35:35,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:35,563 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 33 treesize of output 28 [2024-11-19 00:35:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:35:35,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:35,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:35,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644404673] [2024-11-19 00:35:35,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644404673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:35,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:35,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:35:35,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628212506] [2024-11-19 00:35:35,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:35,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:35:35,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:35,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:35:35,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:35:35,715 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:35:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:36,269 INFO L93 Difference]: Finished difference Result 228 states and 316 transitions. [2024-11-19 00:35:36,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:35:36,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-11-19 00:35:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:36,272 INFO L225 Difference]: With dead ends: 228 [2024-11-19 00:35:36,272 INFO L226 Difference]: Without dead ends: 135 [2024-11-19 00:35:36,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:35:36,276 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 230 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:36,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 548 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:35:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-19 00:35:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2024-11-19 00:35:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:35:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2024-11-19 00:35:36,295 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 103 [2024-11-19 00:35:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:36,296 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2024-11-19 00:35:36,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:35:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2024-11-19 00:35:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:36,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:36,298 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:36,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:35:36,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:36,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:36,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash -243098285, now seen corresponding path program 1 times [2024-11-19 00:35:36,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:36,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767864571] [2024-11-19 00:35:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:36,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:36,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:36,505 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:36,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:35:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:36,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 00:35:36,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:36,783 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 33 treesize of output 28 [2024-11-19 00:35:37,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:37,000 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 69 treesize of output 31 [2024-11-19 00:35:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:35:37,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:37,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:37,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767864571] [2024-11-19 00:35:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767864571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:37,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:37,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:35:37,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249689138] [2024-11-19 00:35:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:37,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:35:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:37,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:35:37,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:35:37,068 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:35:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:37,790 INFO L93 Difference]: Finished difference Result 232 states and 317 transitions. [2024-11-19 00:35:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 00:35:37,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-11-19 00:35:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:37,793 INFO L225 Difference]: With dead ends: 232 [2024-11-19 00:35:37,793 INFO L226 Difference]: Without dead ends: 135 [2024-11-19 00:35:37,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:35:37,795 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 208 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:37,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 696 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:35:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-19 00:35:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2024-11-19 00:35:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:35:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2024-11-19 00:35:37,812 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 103 [2024-11-19 00:35:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:37,812 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2024-11-19 00:35:37,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:35:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2024-11-19 00:35:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:37,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:37,814 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:37,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 00:35:38,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:38,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:38,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:38,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1254215535, now seen corresponding path program 1 times [2024-11-19 00:35:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551438096] [2024-11-19 00:35:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:38,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:38,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:38,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:38,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 00:35:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:38,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:35:38,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:38,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 00:35:38,389 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 41 treesize of output 19 [2024-11-19 00:35:38,500 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 41 treesize of output 19 [2024-11-19 00:35:38,603 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 36 treesize of output 29 [2024-11-19 00:35:39,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:39,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2024-11-19 00:35:39,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:39,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 30 [2024-11-19 00:35:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 128 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-19 00:35:39,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:35:39,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:39,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551438096] [2024-11-19 00:35:39,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551438096] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:35:39,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:35:39,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-11-19 00:35:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413482808] [2024-11-19 00:35:39,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:35:39,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 00:35:39,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:39,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 00:35:39,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:35:39,476 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 7 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-19 00:35:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:40,285 INFO L93 Difference]: Finished difference Result 263 states and 352 transitions. [2024-11-19 00:35:40,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 00:35:40,287 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 7 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) Word has length 103 [2024-11-19 00:35:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:40,288 INFO L225 Difference]: With dead ends: 263 [2024-11-19 00:35:40,289 INFO L226 Difference]: Without dead ends: 166 [2024-11-19 00:35:40,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:35:40,293 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 638 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:40,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 520 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:35:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-19 00:35:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 108. [2024-11-19 00:35:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:35:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2024-11-19 00:35:40,316 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 103 [2024-11-19 00:35:40,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:40,317 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2024-11-19 00:35:40,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 14 states have internal predecessors, (92), 7 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-19 00:35:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2024-11-19 00:35:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:40,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:40,319 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:40,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 00:35:40,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:40,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:40,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 935648248, now seen corresponding path program 1 times [2024-11-19 00:35:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:40,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806372376] [2024-11-19 00:35:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:40,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:40,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:40,534 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:40,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 00:35:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:40,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 00:35:40,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:40,778 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 33 treesize of output 28 [2024-11-19 00:35:40,878 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 30 treesize of output 26 [2024-11-19 00:35:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:35:41,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:41,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:41,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806372376] [2024-11-19 00:35:41,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806372376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:41,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:41,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:35:41,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284190004] [2024-11-19 00:35:41,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:41,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:35:41,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:41,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:35:41,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:35:41,022 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:35:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:41,717 INFO L93 Difference]: Finished difference Result 359 states and 463 transitions. [2024-11-19 00:35:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 00:35:41,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-11-19 00:35:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:41,721 INFO L225 Difference]: With dead ends: 359 [2024-11-19 00:35:41,721 INFO L226 Difference]: Without dead ends: 254 [2024-11-19 00:35:41,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:35:41,725 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 386 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:41,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 733 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:35:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-19 00:35:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 115. [2024-11-19 00:35:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.303030303030303) internal successors, (129), 99 states have internal predecessors, (129), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:35:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 151 transitions. [2024-11-19 00:35:41,745 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 151 transitions. Word has length 103 [2024-11-19 00:35:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:41,746 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 151 transitions. [2024-11-19 00:35:41,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:35:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 151 transitions. [2024-11-19 00:35:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:35:41,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:41,748 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:41,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 00:35:41,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:41,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:41,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1365174342, now seen corresponding path program 1 times [2024-11-19 00:35:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190736697] [2024-11-19 00:35:41,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:41,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:41,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:41,954 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:35:41,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 00:35:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:42,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 00:35:42,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:42,539 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 121 treesize of output 61 [2024-11-19 00:35:42,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:42,663 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 154 treesize of output 58 [2024-11-19 00:35:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 00:35:42,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:54,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:54,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190736697] [2024-11-19 00:35:54,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190736697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:54,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [840995016] [2024-11-19 00:35:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:54,982 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:35:54,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:35:54,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:35:54,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-19 00:35:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:55,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 00:35:55,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:57,038 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 121 treesize of output 61 [2024-11-19 00:35:57,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:57,412 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 154 treesize of output 58 [2024-11-19 00:35:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 00:35:57,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:04,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [840995016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:04,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:36:04,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-19 00:36:04,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360714561] [2024-11-19 00:36:04,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:36:04,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:36:04,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:04,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:36:04,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:36:04,643 INFO L87 Difference]: Start difference. First operand 115 states and 151 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:36:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:09,396 INFO L93 Difference]: Finished difference Result 426 states and 561 transitions. [2024-11-19 00:36:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:36:09,397 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-11-19 00:36:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:09,399 INFO L225 Difference]: With dead ends: 426 [2024-11-19 00:36:09,399 INFO L226 Difference]: Without dead ends: 314 [2024-11-19 00:36:09,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:36:09,400 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 380 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:09,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1395 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 00:36:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-19 00:36:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 303. [2024-11-19 00:36:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 261 states have (on average 1.2988505747126438) internal successors, (339), 263 states have internal predecessors, (339), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:36:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 399 transitions. [2024-11-19 00:36:09,449 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 399 transitions. Word has length 103 [2024-11-19 00:36:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:09,449 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 399 transitions. [2024-11-19 00:36:09,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:36:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 399 transitions. [2024-11-19 00:36:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:36:09,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:09,453 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:09,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:09,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:09,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 00:36:09,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:09,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1874647432, now seen corresponding path program 1 times [2024-11-19 00:36:09,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:09,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404747078] [2024-11-19 00:36:09,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:09,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:09,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:09,857 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:09,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 00:36:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:10,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:36:10,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:12,384 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 88 treesize of output 34 [2024-11-19 00:36:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 00:36:12,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:12,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:12,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404747078] [2024-11-19 00:36:12,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404747078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:12,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:12,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:36:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297066397] [2024-11-19 00:36:12,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:12,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:36:12,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:12,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:36:12,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:36:12,583 INFO L87 Difference]: Start difference. First operand 303 states and 399 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:36:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:15,084 INFO L93 Difference]: Finished difference Result 518 states and 677 transitions. [2024-11-19 00:36:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:36:15,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-11-19 00:36:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:15,089 INFO L225 Difference]: With dead ends: 518 [2024-11-19 00:36:15,089 INFO L226 Difference]: Without dead ends: 218 [2024-11-19 00:36:15,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:36:15,091 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 277 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:15,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 634 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 00:36:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-19 00:36:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2024-11-19 00:36:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 183 states have (on average 1.278688524590164) internal successors, (234), 184 states have internal predecessors, (234), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:36:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 278 transitions. [2024-11-19 00:36:15,118 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 278 transitions. Word has length 103 [2024-11-19 00:36:15,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:15,119 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 278 transitions. [2024-11-19 00:36:15,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:36:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 278 transitions. [2024-11-19 00:36:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:36:15,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:15,120 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:15,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 00:36:15,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:15,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:15,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1846254600, now seen corresponding path program 1 times [2024-11-19 00:36:15,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:15,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122411208] [2024-11-19 00:36:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:15,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:15,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:15,323 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:15,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 00:36:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:15,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:36:15,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 00:36:15,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:15,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:15,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122411208] [2024-11-19 00:36:15,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122411208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:15,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:15,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:36:15,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706343234] [2024-11-19 00:36:15,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:15,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:36:15,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:15,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:36:15,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:36:15,595 INFO L87 Difference]: Start difference. First operand 215 states and 278 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:36:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:15,755 INFO L93 Difference]: Finished difference Result 427 states and 553 transitions. [2024-11-19 00:36:15,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:36:15,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-11-19 00:36:15,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:15,759 INFO L225 Difference]: With dead ends: 427 [2024-11-19 00:36:15,759 INFO L226 Difference]: Without dead ends: 215 [2024-11-19 00:36:15,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:36:15,760 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:15,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:36:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-19 00:36:15,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-19 00:36:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 183 states have (on average 1.273224043715847) internal successors, (233), 184 states have internal predecessors, (233), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:36:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 277 transitions. [2024-11-19 00:36:15,785 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 277 transitions. Word has length 103 [2024-11-19 00:36:15,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:15,786 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 277 transitions. [2024-11-19 00:36:15,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:36:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 277 transitions. [2024-11-19 00:36:15,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:36:15,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:15,787 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:15,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 00:36:15,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:15,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:15,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash -450500691, now seen corresponding path program 1 times [2024-11-19 00:36:15,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:15,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359340510] [2024-11-19 00:36:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:15,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:15,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:15,994 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:15,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 00:36:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:16,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 00:36:16,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:16,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:16,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 33 treesize of output 28 [2024-11-19 00:36:17,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:17,135 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 78 treesize of output 44 [2024-11-19 00:36:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:36:17,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:17,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359340510] [2024-11-19 00:36:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359340510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:17,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:17,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:36:17,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72206263] [2024-11-19 00:36:17,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:17,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:36:17,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:17,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:36:17,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:17,338 INFO L87 Difference]: Start difference. First operand 215 states and 277 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:36:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:20,564 INFO L93 Difference]: Finished difference Result 498 states and 633 transitions. [2024-11-19 00:36:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 00:36:20,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-11-19 00:36:20,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:20,566 INFO L225 Difference]: With dead ends: 498 [2024-11-19 00:36:20,566 INFO L226 Difference]: Without dead ends: 286 [2024-11-19 00:36:20,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:36:20,571 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 198 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:20,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 693 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 00:36:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-19 00:36:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 219. [2024-11-19 00:36:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 187 states have (on average 1.267379679144385) internal successors, (237), 188 states have internal predecessors, (237), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:36:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 281 transitions. [2024-11-19 00:36:20,600 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 281 transitions. Word has length 105 [2024-11-19 00:36:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:20,601 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 281 transitions. [2024-11-19 00:36:20,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:36:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 281 transitions. [2024-11-19 00:36:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:36:20,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:20,602 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:20,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 00:36:20,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:20,803 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:20,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash 250563887, now seen corresponding path program 1 times [2024-11-19 00:36:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:20,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572005874] [2024-11-19 00:36:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:20,805 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:20,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 00:36:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:20,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 00:36:20,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:21,022 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 30 treesize of output 26 [2024-11-19 00:36:21,223 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 34 treesize of output 26 [2024-11-19 00:36:21,298 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 45 treesize of output 21 [2024-11-19 00:36:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:36:21,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:21,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572005874] [2024-11-19 00:36:21,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572005874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:21,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:21,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:36:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673708619] [2024-11-19 00:36:21,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:21,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:36:21,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:21,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:36:21,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:36:21,549 INFO L87 Difference]: Start difference. First operand 219 states and 281 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:36:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:23,530 INFO L93 Difference]: Finished difference Result 641 states and 822 transitions. [2024-11-19 00:36:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:36:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-19 00:36:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:23,533 INFO L225 Difference]: With dead ends: 641 [2024-11-19 00:36:23,533 INFO L226 Difference]: Without dead ends: 425 [2024-11-19 00:36:23,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:36:23,534 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 116 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:23,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 844 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 00:36:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-19 00:36:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 249. [2024-11-19 00:36:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 217 states have (on average 1.262672811059908) internal successors, (274), 218 states have internal predecessors, (274), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:36:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 318 transitions. [2024-11-19 00:36:23,562 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 318 transitions. Word has length 105 [2024-11-19 00:36:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:23,563 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 318 transitions. [2024-11-19 00:36:23,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:36:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 318 transitions. [2024-11-19 00:36:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:36:23,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:23,564 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:23,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 00:36:23,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:23,765 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:23,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash -820663160, now seen corresponding path program 1 times [2024-11-19 00:36:23,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:23,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027446696] [2024-11-19 00:36:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:23,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:23,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:23,768 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:23,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 00:36:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:23,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:36:23,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:23,949 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 21 treesize of output 9 [2024-11-19 00:36:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:36:24,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:24,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:24,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027446696] [2024-11-19 00:36:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027446696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:24,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:24,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:36:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565294445] [2024-11-19 00:36:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:36:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:24,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:36:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:36:24,027 INFO L87 Difference]: Start difference. First operand 249 states and 318 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:36:24,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:24,119 INFO L93 Difference]: Finished difference Result 491 states and 627 transitions. [2024-11-19 00:36:24,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:36:24,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-19 00:36:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:24,123 INFO L225 Difference]: With dead ends: 491 [2024-11-19 00:36:24,123 INFO L226 Difference]: Without dead ends: 245 [2024-11-19 00:36:24,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:36:24,125 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:24,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:36:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-19 00:36:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-19 00:36:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 213 states have (on average 1.2394366197183098) internal successors, (264), 214 states have internal predecessors, (264), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:36:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 308 transitions. [2024-11-19 00:36:24,151 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 308 transitions. Word has length 105 [2024-11-19 00:36:24,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:24,151 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 308 transitions. [2024-11-19 00:36:24,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:36:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 308 transitions. [2024-11-19 00:36:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:36:24,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:24,153 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:24,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 00:36:24,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:24,354 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:24,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash 276194934, now seen corresponding path program 1 times [2024-11-19 00:36:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:24,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18701733] [2024-11-19 00:36:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:24,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:24,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:24,358 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:24,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 00:36:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:24,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:36:24,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:24,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 00:36:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:36:24,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:24,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:24,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18701733] [2024-11-19 00:36:24,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18701733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:24,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:24,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:36:24,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124379497] [2024-11-19 00:36:24,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:24,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:36:24,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:24,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:36:24,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:36:24,626 INFO L87 Difference]: Start difference. First operand 245 states and 308 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:36:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:24,699 INFO L93 Difference]: Finished difference Result 442 states and 553 transitions. [2024-11-19 00:36:24,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:36:24,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-19 00:36:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:24,701 INFO L225 Difference]: With dead ends: 442 [2024-11-19 00:36:24,702 INFO L226 Difference]: Without dead ends: 200 [2024-11-19 00:36:24,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:36:24,703 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:24,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:36:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-19 00:36:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-19 00:36:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 168 states have (on average 1.2023809523809523) internal successors, (202), 169 states have internal predecessors, (202), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:36:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 246 transitions. [2024-11-19 00:36:24,730 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 246 transitions. Word has length 105 [2024-11-19 00:36:24,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:24,731 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 246 transitions. [2024-11-19 00:36:24,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:36:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 246 transitions. [2024-11-19 00:36:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:36:24,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:24,732 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:24,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 00:36:24,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:24,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:24,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash -720393240, now seen corresponding path program 1 times [2024-11-19 00:36:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:24,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867474604] [2024-11-19 00:36:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:24,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:24,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:24,934 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:24,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 00:36:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:25,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 00:36:25,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:25,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:36:27,275 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 121 treesize of output 61 [2024-11-19 00:36:28,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:28,734 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 154 treesize of output 58 [2024-11-19 00:36:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 00:36:29,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:36:31,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867474604] [2024-11-19 00:36:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867474604] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:31,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:31,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-11-19 00:36:31,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178247349] [2024-11-19 00:36:31,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:31,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:36:31,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:36:31,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:36:31,357 INFO L87 Difference]: Start difference. First operand 200 states and 246 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:36:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:33,885 INFO L93 Difference]: Finished difference Result 563 states and 695 transitions. [2024-11-19 00:36:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:36:33,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-19 00:36:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:33,889 INFO L225 Difference]: With dead ends: 563 [2024-11-19 00:36:33,889 INFO L226 Difference]: Without dead ends: 366 [2024-11-19 00:36:33,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:36:33,891 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 284 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:33,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 920 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 00:36:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-19 00:36:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 234. [2024-11-19 00:36:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 202 states have (on average 1.202970297029703) internal successors, (243), 203 states have internal predecessors, (243), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:36:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 287 transitions. [2024-11-19 00:36:33,922 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 287 transitions. Word has length 107 [2024-11-19 00:36:33,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:33,923 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 287 transitions. [2024-11-19 00:36:33,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:36:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 287 transitions. [2024-11-19 00:36:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:36:33,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:33,924 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:33,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 00:36:34,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:34,129 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:34,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:34,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1113420250, now seen corresponding path program 1 times [2024-11-19 00:36:34,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:34,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704134574] [2024-11-19 00:36:34,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:34,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:34,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:34,131 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:34,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 00:36:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:34,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 00:36:34,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:36,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:36,438 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 119 treesize of output 41 [2024-11-19 00:36:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:36:36,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:36,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704134574] [2024-11-19 00:36:36,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704134574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:36,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:36,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:36:36,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47858653] [2024-11-19 00:36:36,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:36,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:36:36,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:36,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:36:36,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:36:36,643 INFO L87 Difference]: Start difference. First operand 234 states and 287 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:36:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:38,782 INFO L93 Difference]: Finished difference Result 724 states and 893 transitions. [2024-11-19 00:36:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:36:38,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-19 00:36:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:38,786 INFO L225 Difference]: With dead ends: 724 [2024-11-19 00:36:38,786 INFO L226 Difference]: Without dead ends: 493 [2024-11-19 00:36:38,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:36:38,789 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 358 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:38,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 518 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 00:36:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-19 00:36:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 260. [2024-11-19 00:36:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 228 states have (on average 1.1929824561403508) internal successors, (272), 229 states have internal predecessors, (272), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:36:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 316 transitions. [2024-11-19 00:36:38,820 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 316 transitions. Word has length 107 [2024-11-19 00:36:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:38,821 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 316 transitions. [2024-11-19 00:36:38,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:36:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 316 transitions. [2024-11-19 00:36:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:36:38,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:38,822 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:36:38,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 00:36:39,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:39,023 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:39,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:39,023 INFO L85 PathProgramCache]: Analyzing trace with hash -651807763, now seen corresponding path program 1 times [2024-11-19 00:36:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:39,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067988153] [2024-11-19 00:36:39,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:39,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:39,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:39,025 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:39,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 00:36:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:39,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 00:36:39,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:41,534 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 119 treesize of output 59