./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.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-8.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 3812ed47486d263f6b3b8dc47cacf4510da1c1e9619759cd56ba725df10b3e2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:39:33,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:39:33,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:39:33,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:39:33,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:39:33,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:39:33,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:39:33,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:39:33,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:39:33,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:39:33,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:39:33,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:39:33,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:39:33,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:39:33,661 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:39:33,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:39:33,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:39:33,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:39:33,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:39:33,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:39:33,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:39:33,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:39:33,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:39:33,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:39:33,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:39:33,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:39:33,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:39:33,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:39:33,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:39:33,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:39:33,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:39:33,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:39:33,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:39:33,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:39:33,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:39:33,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:39:33,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:39:33,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:39:33,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:39:33,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:39:33,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:39:33,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:39:33,674 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 -> 3812ed47486d263f6b3b8dc47cacf4510da1c1e9619759cd56ba725df10b3e2b [2024-11-19 00:39:33,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:39:33,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:39:33,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:39:33,980 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:39:33,981 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:39:33,982 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-8.i [2024-11-19 00:39:35,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:39:35,687 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:39:35,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i [2024-11-19 00:39:35,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87597c87e/6a2f69cf9ba449a299439993721e4ced/FLAGe3c16572c [2024-11-19 00:39:36,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87597c87e/6a2f69cf9ba449a299439993721e4ced [2024-11-19 00:39:36,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:39:36,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:39:36,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:39:36,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:39:36,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:39:36,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a838291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36, skipping insertion in model container [2024-11-19 00:39:36,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:39:36,273 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-8.i[915,928] [2024-11-19 00:39:36,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:39:36,347 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:39:36,357 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-8.i[915,928] [2024-11-19 00:39:36,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:39:36,420 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:39:36,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36 WrapperNode [2024-11-19 00:39:36,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:39:36,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:39:36,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:39:36,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:39:36,431 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:39:36" (1/1) ... [2024-11-19 00:39:36,448 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:39:36" (1/1) ... [2024-11-19 00:39:36,492 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 447 [2024-11-19 00:39:36,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:39:36,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:39:36,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:39:36,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:39:36,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,562 INFO L175 MemorySlicer]: Split 126 memory accesses to 5 slices as follows [2, 29, 48, 22, 25]. 38 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 6, 2, 2]. The 19 writes are split as follows [0, 6, 7, 4, 2]. [2024-11-19 00:39:36,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:39:36,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:39:36,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:39:36,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:39:36,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36" (1/1) ... [2024-11-19 00:39:36,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:39:36,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:39:36,673 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:39:36,681 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:39:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:39:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:39:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:39:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:39:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:39:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:39:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:39:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:39:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:39:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:39:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:39:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:39:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:39:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:39:36,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:39:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:39:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:39:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:39:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:39:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:39:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:39:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:39:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:39:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:39:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:39:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:39:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:39:36,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:39:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:39:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:39:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:39:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:39:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:39:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:39:36,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:39:36,904 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:39:36,906 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:39:37,435 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-19 00:39:37,435 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:39:37,456 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:39:37,458 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:39:37,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:39:37 BoogieIcfgContainer [2024-11-19 00:39:37,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:39:37,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:39:37,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:39:37,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:39:37,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:39:36" (1/3) ... [2024-11-19 00:39:37,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74900f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:39:37, skipping insertion in model container [2024-11-19 00:39:37,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:36" (2/3) ... [2024-11-19 00:39:37,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74900f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:39:37, skipping insertion in model container [2024-11-19 00:39:37,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:39:37" (3/3) ... [2024-11-19 00:39:37,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-8.i [2024-11-19 00:39:37,489 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:39:37,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:39:37,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:39:37,564 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;@2d23eb9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:39:37,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:39:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:39:37,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:37,588 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:37,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:37,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash 519972969, now seen corresponding path program 1 times [2024-11-19 00:39:37,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:37,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067420809] [2024-11-19 00:39:37,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-19 00:39:37,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067420809] [2024-11-19 00:39:37,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067420809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:39:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789039076] [2024-11-19 00:39:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:37,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:39:37,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:39:37,992 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:39:37,993 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:39:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:38,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:39:38,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:39:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-19 00:39:38,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:39:38,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789039076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:38,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:39:38,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:39:38,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425777801] [2024-11-19 00:39:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:38,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:39:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:39:38,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:39:38,387 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:38,441 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-19 00:39:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:39:38,443 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-19 00:39:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:38,451 INFO L225 Difference]: With dead ends: 193 [2024-11-19 00:39:38,451 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 00:39:38,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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:39:38,459 INFO L432 NwaCegarLoop]: 138 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, 138 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:39:38,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:39:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 00:39:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 00:39:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-19 00:39:38,501 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2024-11-19 00:39:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:38,502 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-19 00:39:38,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-19 00:39:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:39:38,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:38,507 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:38,527 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:39:38,708 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:39:38,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:38,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1195296213, now seen corresponding path program 1 times [2024-11-19 00:39:38,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:38,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112703459] [2024-11-19 00:39:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:38,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:39:39,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:39,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112703459] [2024-11-19 00:39:39,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112703459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:39,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:39:39,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:39:39,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989321955] [2024-11-19 00:39:39,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:39,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:39:39,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:39,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:39:39,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:39:39,131 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:39,189 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-19 00:39:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:39:39,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-19 00:39:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:39,193 INFO L225 Difference]: With dead ends: 192 [2024-11-19 00:39:39,193 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 00:39:39,194 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:39:39,195 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:39:39,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:39:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 00:39:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-19 00:39:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-19 00:39:39,215 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 123 [2024-11-19 00:39:39,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:39,216 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-19 00:39:39,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-19 00:39:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:39:39,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:39,219 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:39,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:39:39,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:39,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:39,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1875354583, now seen corresponding path program 1 times [2024-11-19 00:39:39,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:39,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471603293] [2024-11-19 00:39:39,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:39,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:39:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:39,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471603293] [2024-11-19 00:39:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471603293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:39,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:39:39,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:39:39,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663358093] [2024-11-19 00:39:39,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:39,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:39:39,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:39,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:39:39,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:39:39,505 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:39,593 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-19 00:39:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:39:39,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-19 00:39:39,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:39,603 INFO L225 Difference]: With dead ends: 196 [2024-11-19 00:39:39,606 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 00:39:39,608 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:39:39,609 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:39:39,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 395 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:39:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 00:39:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-19 00:39:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-19 00:39:39,622 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2024-11-19 00:39:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:39,623 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-19 00:39:39,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-19 00:39:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:39:39,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:39,626 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:39,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:39:39,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:39,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:39,627 INFO L85 PathProgramCache]: Analyzing trace with hash -644605351, now seen corresponding path program 1 times [2024-11-19 00:39:39,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:39,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58778461] [2024-11-19 00:39:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:39,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:39:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58778461] [2024-11-19 00:39:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58778461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:39,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:39:39,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:39:39,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553468220] [2024-11-19 00:39:39,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:39,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:39:39,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:39,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:39:39,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:39:39,817 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:39,854 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-19 00:39:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:39:39,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-19 00:39:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:39,859 INFO L225 Difference]: With dead ends: 200 [2024-11-19 00:39:39,859 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 00:39:39,859 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:39:39,864 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:39:39,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:39:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 00:39:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-19 00:39:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-19 00:39:39,879 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2024-11-19 00:39:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:39,880 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-19 00:39:39,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-19 00:39:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:39:39,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:39,887 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:39,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:39:39,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:39,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash -642758309, now seen corresponding path program 1 times [2024-11-19 00:39:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530902951] [2024-11-19 00:39:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:39:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:40,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530902951] [2024-11-19 00:39:40,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530902951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:40,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:39:40,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:39:40,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031208574] [2024-11-19 00:39:40,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:40,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:39:40,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:40,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:39:40,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:39:40,566 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:40,793 INFO L93 Difference]: Finished difference Result 256 states and 365 transitions. [2024-11-19 00:39:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:39:40,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-19 00:39:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:40,798 INFO L225 Difference]: With dead ends: 256 [2024-11-19 00:39:40,799 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 00:39:40,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:39:40,801 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 127 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:39:40,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 639 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:39:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 00:39:40,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 102. [2024-11-19 00:39:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-11-19 00:39:40,817 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 123 [2024-11-19 00:39:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:40,818 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-11-19 00:39:40,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-11-19 00:39:40,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:39:40,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:40,824 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:40,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:39:40,824 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:40,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1963265245, now seen corresponding path program 1 times [2024-11-19 00:39:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:40,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359615457] [2024-11-19 00:39:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:40,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:39:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:42,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359615457] [2024-11-19 00:39:42,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359615457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:42,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:39:42,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:39:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648251290] [2024-11-19 00:39:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:42,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:39:42,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:42,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:39:42,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:39:42,093 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:42,216 INFO L93 Difference]: Finished difference Result 239 states and 333 transitions. [2024-11-19 00:39:42,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:39:42,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-19 00:39:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:42,218 INFO L225 Difference]: With dead ends: 239 [2024-11-19 00:39:42,219 INFO L226 Difference]: Without dead ends: 140 [2024-11-19 00:39:42,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:39:42,221 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 43 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:39:42,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 688 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:39:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-19 00:39:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2024-11-19 00:39:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-19 00:39:42,233 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 123 [2024-11-19 00:39:42,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:42,233 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-19 00:39:42,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-19 00:39:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:39:42,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:42,235 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:42,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:39:42,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:42,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1481391944, now seen corresponding path program 1 times [2024-11-19 00:39:42,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:42,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050848685] [2024-11-19 00:39:42,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:42,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:39:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:43,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050848685] [2024-11-19 00:39:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050848685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:43,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:39:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:39:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151600633] [2024-11-19 00:39:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:43,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:39:43,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:43,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:39:43,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:39:43,286 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:44,275 INFO L93 Difference]: Finished difference Result 351 states and 495 transitions. [2024-11-19 00:39:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:39:44,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-19 00:39:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:44,278 INFO L225 Difference]: With dead ends: 351 [2024-11-19 00:39:44,278 INFO L226 Difference]: Without dead ends: 248 [2024-11-19 00:39:44,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:39:44,280 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 301 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:39:44,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1485 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:39:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-19 00:39:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 106. [2024-11-19 00:39:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2024-11-19 00:39:44,313 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 125 [2024-11-19 00:39:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:44,315 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2024-11-19 00:39:44,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2024-11-19 00:39:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:39:44,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:44,317 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:44,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:39:44,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:44,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:44,318 INFO L85 PathProgramCache]: Analyzing trace with hash -784364200, now seen corresponding path program 1 times [2024-11-19 00:39:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004457870] [2024-11-19 00:39:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:39:45,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:45,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004457870] [2024-11-19 00:39:45,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004457870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:45,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:39:45,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:39:45,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323819938] [2024-11-19 00:39:45,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:45,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:39:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:45,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:39:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:39:45,204 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:46,234 INFO L93 Difference]: Finished difference Result 345 states and 484 transitions. [2024-11-19 00:39:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:39:46,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-19 00:39:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:46,238 INFO L225 Difference]: With dead ends: 345 [2024-11-19 00:39:46,238 INFO L226 Difference]: Without dead ends: 242 [2024-11-19 00:39:46,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:39:46,240 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 346 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:39:46,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 998 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:39:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-19 00:39:46,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 106. [2024-11-19 00:39:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2024-11-19 00:39:46,267 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 125 [2024-11-19 00:39:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:46,268 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2024-11-19 00:39:46,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2024-11-19 00:39:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:39:46,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:46,271 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:46,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:39:46,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:46,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:46,272 INFO L85 PathProgramCache]: Analyzing trace with hash -413001585, now seen corresponding path program 1 times [2024-11-19 00:39:46,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:46,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859474930] [2024-11-19 00:39:46,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:46,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:39:46,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:46,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859474930] [2024-11-19 00:39:46,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859474930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:46,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:39:46,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:39:46,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672216008] [2024-11-19 00:39:46,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:46,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:39:46,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:46,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:39:46,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:39:46,825 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:47,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:47,071 INFO L93 Difference]: Finished difference Result 267 states and 373 transitions. [2024-11-19 00:39:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:39:47,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-19 00:39:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:47,074 INFO L225 Difference]: With dead ends: 267 [2024-11-19 00:39:47,074 INFO L226 Difference]: Without dead ends: 164 [2024-11-19 00:39:47,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:39:47,075 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 123 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:39:47,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1031 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:39:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-19 00:39:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 109. [2024-11-19 00:39:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 93 states have internal predecessors, (121), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 149 transitions. [2024-11-19 00:39:47,093 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 149 transitions. Word has length 125 [2024-11-19 00:39:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:47,093 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 149 transitions. [2024-11-19 00:39:47,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 149 transitions. [2024-11-19 00:39:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 00:39:47,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:47,096 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:47,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:39:47,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:47,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:47,097 INFO L85 PathProgramCache]: Analyzing trace with hash 319862387, now seen corresponding path program 1 times [2024-11-19 00:39:47,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073115837] [2024-11-19 00:39:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:47,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:39:47,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:47,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073115837] [2024-11-19 00:39:47,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073115837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:47,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:39:47,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:39:47,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443131044] [2024-11-19 00:39:47,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:47,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:39:47,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:47,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:39:47,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:39:47,688 INFO L87 Difference]: Start difference. First operand 109 states and 149 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:47,936 INFO L93 Difference]: Finished difference Result 322 states and 443 transitions. [2024-11-19 00:39:47,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:39:47,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-19 00:39:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:47,938 INFO L225 Difference]: With dead ends: 322 [2024-11-19 00:39:47,938 INFO L226 Difference]: Without dead ends: 216 [2024-11-19 00:39:47,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:39:47,940 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 131 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:39:47,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 964 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:39:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-19 00:39:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 114. [2024-11-19 00:39:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2024-11-19 00:39:47,957 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 127 [2024-11-19 00:39:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:47,958 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2024-11-19 00:39:47,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2024-11-19 00:39:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 00:39:47,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:47,959 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:47,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:39:47,960 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:47,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash 645647618, now seen corresponding path program 1 times [2024-11-19 00:39:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922027340] [2024-11-19 00:39:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:39:50,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:50,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922027340] [2024-11-19 00:39:50,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922027340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:50,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:39:50,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 00:39:50,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442829656] [2024-11-19 00:39:50,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:50,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:39:50,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:50,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:39:50,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:39:50,042 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:50,877 INFO L93 Difference]: Finished difference Result 253 states and 348 transitions. [2024-11-19 00:39:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:39:50,878 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-11-19 00:39:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:50,879 INFO L225 Difference]: With dead ends: 253 [2024-11-19 00:39:50,879 INFO L226 Difference]: Without dead ends: 251 [2024-11-19 00:39:50,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-11-19 00:39:50,880 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 350 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:39:50,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1844 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:39:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-19 00:39:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 166. [2024-11-19 00:39:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 138 states have internal predecessors, (178), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 00:39:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2024-11-19 00:39:50,939 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 127 [2024-11-19 00:39:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:50,940 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2024-11-19 00:39:50,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:39:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2024-11-19 00:39:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 00:39:50,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:50,942 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:50,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:39:50,942 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:50,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:50,943 INFO L85 PathProgramCache]: Analyzing trace with hash 647494660, now seen corresponding path program 1 times [2024-11-19 00:39:50,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:50,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195199884] [2024-11-19 00:39:50,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:50,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:39:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:39:51,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:39:51,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195199884] [2024-11-19 00:39:51,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195199884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:39:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:39:51,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:39:51,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243794842] [2024-11-19 00:39:51,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:39:51,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:39:51,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:39:51,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:39:51,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:39:51,405 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:39:51,535 INFO L93 Difference]: Finished difference Result 294 states and 399 transitions. [2024-11-19 00:39:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:39:51,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-19 00:39:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:39:51,538 INFO L225 Difference]: With dead ends: 294 [2024-11-19 00:39:51,539 INFO L226 Difference]: Without dead ends: 176 [2024-11-19 00:39:51,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:39:51,540 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 113 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:39:51,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 666 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:39:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-19 00:39:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2024-11-19 00:39:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 143 states have internal predecessors, (182), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:39:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 238 transitions. [2024-11-19 00:39:51,579 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 238 transitions. Word has length 127 [2024-11-19 00:39:51,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:39:51,579 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 238 transitions. [2024-11-19 00:39:51,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:39:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 238 transitions. [2024-11-19 00:39:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 00:39:51,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:51,583 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:51,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:39:51,583 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:51,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1872465274, now seen corresponding path program 1 times [2024-11-19 00:39:51,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:39:51,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853871048] [2024-11-19 00:39:51,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:39:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:39:51,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71963058] [2024-11-19 00:39:51,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:51,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:39:51,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:39:51,678 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:39:51,680 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:39:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:39:52,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:39:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:39:52,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:39:52,389 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:39:52,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:39:52,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:39:52,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 00:39:52,595 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:52,693 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:39:52,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:39:52 BoogieIcfgContainer [2024-11-19 00:39:52,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:39:52,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:39:52,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:39:52,697 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:39:52,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:39:37" (3/4) ... [2024-11-19 00:39:52,700 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:39:52,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:39:52,702 INFO L158 Benchmark]: Toolchain (without parser) took 16645.07ms. Allocated memory was 155.2MB in the beginning and 494.9MB in the end (delta: 339.7MB). Free memory was 81.4MB in the beginning and 430.1MB in the end (delta: -348.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:39:52,703 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:39:52,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.77ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 64.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:39:52,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.07ms. Allocated memory is still 155.2MB. Free memory was 64.8MB in the beginning and 60.8MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:39:52,704 INFO L158 Benchmark]: Boogie Preprocessor took 135.78ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 60.8MB in the beginning and 167.6MB in the end (delta: -106.8MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-19 00:39:52,704 INFO L158 Benchmark]: RCFGBuilder took 828.32ms. Allocated memory is still 197.1MB. Free memory was 167.6MB in the beginning and 133.0MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-19 00:39:52,704 INFO L158 Benchmark]: TraceAbstraction took 15235.31ms. Allocated memory was 197.1MB in the beginning and 494.9MB in the end (delta: 297.8MB). Free memory was 133.0MB in the beginning and 431.1MB in the end (delta: -298.1MB). Peak memory consumption was 707.0kB. Max. memory is 16.1GB. [2024-11-19 00:39:52,704 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 494.9MB. Free memory was 431.1MB in the beginning and 430.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:39:52,706 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.24ms. Allocated memory is still 155.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.77ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 64.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.07ms. Allocated memory is still 155.2MB. Free memory was 64.8MB in the beginning and 60.8MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.78ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 60.8MB in the beginning and 167.6MB in the end (delta: -106.8MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * RCFGBuilder took 828.32ms. Allocated memory is still 197.1MB. Free memory was 167.6MB in the beginning and 133.0MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15235.31ms. Allocated memory was 197.1MB in the beginning and 494.9MB in the end (delta: 297.8MB). Free memory was 133.0MB in the beginning and 431.1MB in the end (delta: -298.1MB). Peak memory consumption was 707.0kB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 494.9MB. Free memory was 431.1MB in the beginning and 430.1MB in the end (delta: 1.0MB). 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 91, overapproximation of someBinaryArithmeticFLOAToperation at line 55. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 0 }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L25-L27] float float_Array_0[2][3] = { {2.4, 256.75, 0.0}, {127.75, 256.6, 31.4} }; [L28-L30] signed long int signed_long_int_Array_0[2] = { 64, 0 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { 64, 0 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { 64, 0 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 100, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 100, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 100, 32 }; 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}] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, 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}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, 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) 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] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_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}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, 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}] [L68] RET assume_abort_if_not(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}] [L69] EXPR BOOL_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}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, 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[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}] [L70] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_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}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_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}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_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}] [L72] EXPR BOOL_unsigned_char_Array_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}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_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}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_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}] [L73] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 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}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 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}] [L75] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 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}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 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}] [L76] float_Array_0[1][0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR (float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR (float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not((float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, 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((float_Array_0[1][0] >= -461168.6018427382800e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] float_Array_0[0][1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[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}] [L79] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[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}] [L79] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[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}] [L79] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[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}] [L79] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[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}] [L79] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[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}] [L80] float_Array_0[0][2] = __VERIFIER_nondet_float() [L81] EXPR float_Array_0[0][2] [L81] EXPR float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F [L81] EXPR float_Array_0[0][2] [L81] EXPR float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR (float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 4611686.018427382800e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR (float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 4611686.018427382800e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] CALL assume_abort_if_not((float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 4611686.018427382800e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, 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}] [L81] RET assume_abort_if_not((float_Array_0[0][2] >= 2305843.009213691390e+12F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 4611686.018427382800e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] float_Array_0[1][2] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[1][2] [L83] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F [L83] EXPR float_Array_0[1][2] [L83] EXPR float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 2305843.009213691390e+12F && float_Array_0[1][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 2305843.009213691390e+12F && float_Array_0[1][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not((float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 2305843.009213691390e+12F && float_Array_0[1][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, 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}] [L83] RET assume_abort_if_not((float_Array_0[1][2] >= 0.0F && float_Array_0[1][2] <= -1.0e-20F) || (float_Array_0[1][2] <= 2305843.009213691390e+12F && float_Array_0[1][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L85] 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}] [L85] 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}] [L85] 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}] [L86] 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}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) 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}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) 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}] [L99] RET updateVariables() [L100] CALL step() [L37] EXPR float_Array_0[0][2] [L37] float_Array_0[1][1] = float_Array_0[0][2] [L38] EXPR unsigned_char_Array_0[0] [L38] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L39] EXPR unsigned_char_Array_0[1] [L39] signed_long_int_Array_0[1] = unsigned_char_Array_0[1] [L40] EXPR unsigned_char_Array_0[1] [L40] unsigned char stepLocal_1 = unsigned_char_Array_0[1]; [L41] EXPR signed_long_int_Array_0[1] [L41] EXPR signed_long_int_Array_0[1] [L41] EXPR unsigned_char_Array_0[1] [L41] EXPR unsigned_char_Array_0[1] [L41] signed long int stepLocal_0 = (signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]); [L42] COND FALSE !(stepLocal_0 >= 1u) [L49] EXPR unsigned_char_Array_0[1] [L49] signed_long_int_Array_0[0] = unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0] [L51] signed long int stepLocal_2 = signed_long_int_Array_0[0]; [L52] 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}] [L52] COND FALSE !(unsigned_char_Array_0[1] > stepLocal_2) [L55] EXPR float_Array_0[0][1] [L55] EXPR float_Array_0[0][2] [L55] EXPR float_Array_0[1][2] [L55] float_Array_0[0][0] = (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])) [L57] EXPR signed_long_int_Array_0[1] [L57] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L57] COND FALSE !(signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) [L60] EXPR BOOL_unsigned_char_Array_0[0] [L60] BOOL_unsigned_char_Array_0[4] = BOOL_unsigned_char_Array_0[0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR signed_long_int_Array_0[1] [L91] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR (signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) [L91] EXPR BOOL_unsigned_char_Array_0[4] [L91] EXPR BOOL_unsigned_char_Array_0[0] [L91] EXPR (signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR ((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) 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}] [L91] EXPR ((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) [L91] EXPR signed_long_int_Array_0[1] [L91] EXPR signed_long_int_Array_0[1] [L91] EXPR unsigned_char_Array_0[1] [L91] 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}] [L91] EXPR (((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) [L91] EXPR signed_long_int_Array_0[0] [L91] EXPR unsigned_char_Array_0[1] [L91] EXPR (((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) 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}] [L91] EXPR ((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) 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}] [L91] EXPR (((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_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}] [L91] EXPR (((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2]))))) [L91] EXPR unsigned_char_Array_0[1] [L91] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR (unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))) [L91] EXPR float_Array_0[0][0] [L91] EXPR float_Array_0[0][1] [L91] EXPR float_Array_0[0][2] [L91] EXPR float_Array_0[1][2] [L91] EXPR (unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_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}] [L91] EXPR (((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_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}] [L91] EXPR ((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_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}] [L91] EXPR ((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2])) [L91] EXPR float_Array_0[1][1] [L91] EXPR float_Array_0[0][2] [L91] EXPR ((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_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}] [L91] EXPR (((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2]))) && (signed_long_int_Array_0[1] == ((signed long int) 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}] [L91] EXPR (((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2]))) && (signed_long_int_Array_0[1] == ((signed long int) 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}] [L91] EXPR ((((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[1] == ((unsigned char) 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}] [L91] EXPR ((((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[1] == ((unsigned char) 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}] [L91-L92] return ((((((signed_long_int_Array_0[1] >= (8u * signed_long_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (! (BOOL_unsigned_char_Array_0[3] || (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) && ((((signed_long_int_Array_0[1] * signed_long_int_Array_0[1]) * (unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) >= 1u) ? ((signed_long_int_Array_0[1] <= unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])))) && ((unsigned_char_Array_0[1] > signed_long_int_Array_0[0]) ? (float_Array_0[0][0] == ((float) (float_Array_0[1][0] + ((float_Array_0[0][2] - float_Array_0[1][2]) - float_Array_0[0][1])))) : (float_Array_0[0][0] == ((float) (float_Array_0[0][1] - (float_Array_0[0][2] + float_Array_0[1][2])))))) && (float_Array_0[1][1] == ((float) float_Array_0[0][2]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) ; [L101] RET, EXPR property() [L101] 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: 15.1s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1540 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1537 mSDsluCounter, 9639 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7521 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1970 IncrementalHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 2118 mSDtfsCounter, 1970 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=12, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 614 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1871 NumberOfCodeBlocks, 1871 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1604 ConstructedInterpolants, 0 QuantifiedInterpolants, 3961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 4706/4732 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:39:52,743 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-8.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 3812ed47486d263f6b3b8dc47cacf4510da1c1e9619759cd56ba725df10b3e2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:39:55,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:39:55,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:39:55,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:39:55,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:39:55,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:39:55,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:39:55,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:39:55,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:39:55,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:39:55,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:39:55,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:39:55,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:39:55,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:39:55,248 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:39:55,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:39:55,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:39:55,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:39:55,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:39:55,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:39:55,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:39:55,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:39:55,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:39:55,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:39:55,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:39:55,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:39:55,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:39:55,256 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:39:55,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:39:55,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:39:55,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:39:55,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:39:55,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:39:55,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:39:55,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:39:55,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:39:55,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:39:55,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:39:55,258 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:39:55,259 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:39:55,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:39:55,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:39:55,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:39:55,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:39:55,261 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 -> 3812ed47486d263f6b3b8dc47cacf4510da1c1e9619759cd56ba725df10b3e2b [2024-11-19 00:39:55,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:39:55,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:39:55,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:39:55,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:39:55,635 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:39:55,636 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-8.i [2024-11-19 00:39:57,200 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:39:57,434 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:39:57,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-8.i [2024-11-19 00:39:57,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3a7552a/b783bb723d214e7a8b356c89596a4b6e/FLAG4f8b4ea14 [2024-11-19 00:39:57,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3a7552a/b783bb723d214e7a8b356c89596a4b6e [2024-11-19 00:39:57,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:39:57,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:39:57,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:39:57,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:39:57,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:39:57,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:57,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd8dbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57, skipping insertion in model container [2024-11-19 00:39:57,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:57,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:39:57,737 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-8.i[915,928] [2024-11-19 00:39:57,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:39:57,842 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:39:57,858 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-8.i[915,928] [2024-11-19 00:39:57,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:39:57,950 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:39:57,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57 WrapperNode [2024-11-19 00:39:57,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:39:57,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:39:57,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:39:57,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:39:57,958 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:39:57" (1/1) ... [2024-11-19 00:39:57,973 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:39:57" (1/1) ... [2024-11-19 00:39:58,027 INFO L138 Inliner]: procedures = 33, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 447 [2024-11-19 00:39:58,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:39:58,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:39:58,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:39:58,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:39:58,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:58,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:58,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:58,083 INFO L175 MemorySlicer]: Split 126 memory accesses to 5 slices as follows [2, 29, 48, 22, 25]. 38 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 6, 2, 2]. The 19 writes are split as follows [0, 6, 7, 4, 2]. [2024-11-19 00:39:58,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:58,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:58,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:58,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:58,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:58,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:58,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:39:58,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:39:58,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:39:58,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:39:58,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57" (1/1) ... [2024-11-19 00:39:58,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:39:58,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:39:58,167 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:39:58,171 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:39:58,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:39:58,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:39:58,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:39:58,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:39:58,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:39:58,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:39:58,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:39:58,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:39:58,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:39:58,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:39:58,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:39:58,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:39:58,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:39:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:39:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:39:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:39:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:39:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:39:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:39:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:39:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:39:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:39:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:39:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:39:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:39:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:39:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:39:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:39:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:39:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:39:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:39:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:39:58,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:39:58,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:39:58,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:39:58,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:39:58,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:39:58,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:39:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:39:58,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:39:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:39:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:39:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:39:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:39:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:39:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:39:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:39:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:39:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:39:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:39:58,399 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:39:58,402 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:39:59,537 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-19 00:39:59,537 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:39:59,556 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:39:59,556 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:39:59,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:39:59 BoogieIcfgContainer [2024-11-19 00:39:59,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:39:59,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:39:59,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:39:59,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:39:59,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:39:57" (1/3) ... [2024-11-19 00:39:59,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aeade5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:39:59, skipping insertion in model container [2024-11-19 00:39:59,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:39:57" (2/3) ... [2024-11-19 00:39:59,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aeade5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:39:59, skipping insertion in model container [2024-11-19 00:39:59,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:39:59" (3/3) ... [2024-11-19 00:39:59,566 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-8.i [2024-11-19 00:39:59,581 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:39:59,581 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:39:59,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:39:59,658 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;@68040804, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:39:59,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:39:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:39:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:39:59,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:39:59,681 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:39:59,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:39:59,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:39:59,689 INFO L85 PathProgramCache]: Analyzing trace with hash 519972969, now seen corresponding path program 1 times [2024-11-19 00:39:59,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:39:59,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561674433] [2024-11-19 00:39:59,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:39:59,708 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:39:59,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:39:59,712 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:39:59,714 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:40:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:00,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:40:00,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-19 00:40:00,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:00,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:00,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561674433] [2024-11-19 00:40:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561674433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:00,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:00,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:40:00,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804607993] [2024-11-19 00:40:00,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:00,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:40:00,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:00,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:40:00,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:40:00,351 INFO L87 Difference]: Start difference. First operand has 100 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:40:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:00,381 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2024-11-19 00:40:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:40:00,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-19 00:40:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:00,392 INFO L225 Difference]: With dead ends: 193 [2024-11-19 00:40:00,393 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 00:40:00,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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:40:00,401 INFO L432 NwaCegarLoop]: 138 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, 138 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:40:00,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 00:40:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 00:40:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-19 00:40:00,456 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2024-11-19 00:40:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:00,457 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-19 00:40:00,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:40:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-19 00:40:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:40:00,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:00,461 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:00,474 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:40:00,662 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:40:00,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:00,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1195296213, now seen corresponding path program 1 times [2024-11-19 00:40:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:00,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931780548] [2024-11-19 00:40:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:00,665 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:40:00,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:00,669 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:40:00,671 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:40:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:01,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:40:01,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:40:01,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:01,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:01,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931780548] [2024-11-19 00:40:01,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931780548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:01,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:01,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:40:01,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559048510] [2024-11-19 00:40:01,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:01,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:40:01,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:01,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:40:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:40:01,169 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:01,291 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2024-11-19 00:40:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:40:01,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-19 00:40:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:01,295 INFO L225 Difference]: With dead ends: 194 [2024-11-19 00:40:01,295 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 00:40:01,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 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:40:01,299 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:01,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 516 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:01,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 00:40:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-19 00:40:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-19 00:40:01,319 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2024-11-19 00:40:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:01,325 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-19 00:40:01,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-19 00:40:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:40:01,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:01,328 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:01,346 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:40:01,532 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:40:01,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:01,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1875354583, now seen corresponding path program 1 times [2024-11-19 00:40:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:01,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63526448] [2024-11-19 00:40:01,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:01,535 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:40:01,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:01,539 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:40:01,540 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:40:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:01,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:40:01,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:40:02,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:02,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:02,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63526448] [2024-11-19 00:40:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63526448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:02,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:02,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051151432] [2024-11-19 00:40:02,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:02,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:02,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:02,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:02,016 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:02,125 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-19 00:40:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:02,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-19 00:40:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:02,129 INFO L225 Difference]: With dead ends: 200 [2024-11-19 00:40:02,130 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 00:40:02,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:02,132 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:02,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 00:40:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-19 00:40:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-19 00:40:02,154 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2024-11-19 00:40:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:02,166 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-19 00:40:02,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-19 00:40:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:40:02,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:02,168 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:02,187 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:40:02,372 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:40:02,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:02,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:02,374 INFO L85 PathProgramCache]: Analyzing trace with hash -644605351, now seen corresponding path program 1 times [2024-11-19 00:40:02,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:02,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580564905] [2024-11-19 00:40:02,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:02,375 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:40:02,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:02,378 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:40:02,390 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:40:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:02,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:40:02,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:40:02,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:02,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:02,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580564905] [2024-11-19 00:40:02,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580564905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:02,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:02,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:40:02,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702039383] [2024-11-19 00:40:02,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:02,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:40:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:40:02,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:02,844 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:02,946 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2024-11-19 00:40:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:40:02,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-19 00:40:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:02,948 INFO L225 Difference]: With dead ends: 204 [2024-11-19 00:40:02,949 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 00:40:02,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:02,951 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:02,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 755 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 00:40:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-19 00:40:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-11-19 00:40:02,960 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 123 [2024-11-19 00:40:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:02,960 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-11-19 00:40:02,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-11-19 00:40:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 00:40:02,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:02,963 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:02,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:40:03,163 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:40:03,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:03,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:03,165 INFO L85 PathProgramCache]: Analyzing trace with hash -642758309, now seen corresponding path program 1 times [2024-11-19 00:40:03,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:03,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096971700] [2024-11-19 00:40:03,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:03,166 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:40:03,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:03,169 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:40:03,171 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:40:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:03,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:40:03,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:03,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-19 00:40:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-19 00:40:04,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:04,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:04,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096971700] [2024-11-19 00:40:04,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096971700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:04,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:04,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:40:04,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923337043] [2024-11-19 00:40:04,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:04,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:04,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:04,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:04,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:04,012 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:40:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:06,335 INFO L93 Difference]: Finished difference Result 206 states and 290 transitions. [2024-11-19 00:40:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:40:06,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-19 00:40:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:06,337 INFO L225 Difference]: With dead ends: 206 [2024-11-19 00:40:06,337 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 00:40:06,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:40:06,339 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 100 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:06,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 428 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 00:40:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 00:40:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-19 00:40:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2024-11-19 00:40:06,349 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 123 [2024-11-19 00:40:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:06,349 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2024-11-19 00:40:06,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:40:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2024-11-19 00:40:06,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:40:06,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:06,352 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:06,370 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 (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:40:06,552 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:40:06,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:06,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:06,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1841218527, now seen corresponding path program 1 times [2024-11-19 00:40:06,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:06,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130163416] [2024-11-19 00:40:06,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:06,555 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:40:06,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:06,558 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:40:06,560 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:40:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:06,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:40:06,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:07,234 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 97 treesize of output 43 [2024-11-19 00:40:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-19 00:40:07,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:07,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:07,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130163416] [2024-11-19 00:40:07,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130163416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:07,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:07,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:40:07,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151139811] [2024-11-19 00:40:07,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:07,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:07,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:07,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:07,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:07,262 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:40:08,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:40:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:09,975 INFO L93 Difference]: Finished difference Result 206 states and 288 transitions. [2024-11-19 00:40:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:40:09,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-19 00:40:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:09,977 INFO L225 Difference]: With dead ends: 206 [2024-11-19 00:40:09,977 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 00:40:09,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:40:09,978 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 90 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:09,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 423 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 00:40:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 00:40:09,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-19 00:40:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2024-11-19 00:40:09,996 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 125 [2024-11-19 00:40:09,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:09,996 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2024-11-19 00:40:09,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:40:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2024-11-19 00:40:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 00:40:10,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:10,001 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:10,016 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:40:10,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:40:10,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:10,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1289197797, now seen corresponding path program 1 times [2024-11-19 00:40:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:10,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233082554] [2024-11-19 00:40:10,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:10,204 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:40:10,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:10,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:40:10,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 00:40:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:10,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:40:10,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:10,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-19 00:40:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-19 00:40:10,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:10,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:10,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233082554] [2024-11-19 00:40:10,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233082554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:10,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:10,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:40:10,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758141441] [2024-11-19 00:40:10,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:10,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:10,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:10,890 INFO L87 Difference]: Start difference. First operand 104 states and 144 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:40:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:12,708 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2024-11-19 00:40:12,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:40:12,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-11-19 00:40:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:12,710 INFO L225 Difference]: With dead ends: 206 [2024-11-19 00:40:12,710 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 00:40:12,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:40:12,711 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 82 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:12,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 417 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 00:40:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 00:40:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-19 00:40:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2024-11-19 00:40:12,723 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 127 [2024-11-19 00:40:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:12,723 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2024-11-19 00:40:12,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 00:40:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2024-11-19 00:40:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 00:40:12,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:12,725 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:12,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 00:40:12,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:40:12,926 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:12,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:12,927 INFO L85 PathProgramCache]: Analyzing trace with hash -705934367, now seen corresponding path program 1 times [2024-11-19 00:40:12,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:12,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715703977] [2024-11-19 00:40:12,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:12,927 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:40:12,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:12,929 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:40:12,930 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:40:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:13,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:40:13,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:13,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-19 00:40:13,423 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 26 treesize of output 14 [2024-11-19 00:40:13,433 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 17 treesize of output 9 [2024-11-19 00:40:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:40:13,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:13,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:13,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715703977] [2024-11-19 00:40:13,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715703977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:13,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:13,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:40:13,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108661287] [2024-11-19 00:40:13,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:13,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:40:13,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:13,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:40:13,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:13,471 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:14,114 INFO L93 Difference]: Finished difference Result 260 states and 360 transitions. [2024-11-19 00:40:14,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:40:14,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2024-11-19 00:40:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:14,117 INFO L225 Difference]: With dead ends: 260 [2024-11-19 00:40:14,117 INFO L226 Difference]: Without dead ends: 159 [2024-11-19 00:40:14,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:40:14,118 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 125 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:14,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 467 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:40:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-19 00:40:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 104. [2024-11-19 00:40:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2024-11-19 00:40:14,129 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 142 transitions. Word has length 129 [2024-11-19 00:40:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:14,129 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 142 transitions. [2024-11-19 00:40:14,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions. [2024-11-19 00:40:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 00:40:14,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:14,140 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:14,154 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:40:14,341 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:40:14,342 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:14,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1900089187, now seen corresponding path program 1 times [2024-11-19 00:40:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:14,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479551956] [2024-11-19 00:40:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:14,343 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:40:14,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:14,344 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:40:14,345 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:40:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:14,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 00:40:14,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:14,818 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 12 treesize of output 8 [2024-11-19 00:40:15,203 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 46 treesize of output 22 [2024-11-19 00:40:15,404 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 46 treesize of output 22 [2024-11-19 00:40:15,574 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 32 [2024-11-19 00:40:16,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:16,983 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 38 treesize of output 36 [2024-11-19 00:40:17,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:17,153 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 78 treesize of output 38 [2024-11-19 00:40:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 156 proven. 72 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 00:40:17,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:40:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:40:17,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479551956] [2024-11-19 00:40:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479551956] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:17,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:40:17,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 17 [2024-11-19 00:40:17,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467885860] [2024-11-19 00:40:17,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:17,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:40:17,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:17,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:40:17,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:40:17,433 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:17,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:17,584 INFO L93 Difference]: Finished difference Result 245 states and 333 transitions. [2024-11-19 00:40:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:40:17,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2024-11-19 00:40:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:17,586 INFO L225 Difference]: With dead ends: 245 [2024-11-19 00:40:17,586 INFO L226 Difference]: Without dead ends: 144 [2024-11-19 00:40:17,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:40:17,587 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 43 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:17,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 524 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-19 00:40:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2024-11-19 00:40:17,601 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), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2024-11-19 00:40:17,603 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 129 [2024-11-19 00:40:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:17,605 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2024-11-19 00:40:17,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2024-11-19 00:40:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:40:17,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:17,607 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:17,624 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 00:40:17,807 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:40:17,808 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:17,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2064041538, now seen corresponding path program 1 times [2024-11-19 00:40:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:17,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631008520] [2024-11-19 00:40:17,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:17,809 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:40:17,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:17,812 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:40:17,813 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:40:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:18,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:40:18,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:18,451 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 39 treesize of output 21 [2024-11-19 00:40:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 195 proven. 18 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-19 00:40:18,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:40:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-19 00:40:18,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:18,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631008520] [2024-11-19 00:40:18,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631008520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:40:18,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:40:18,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-19 00:40:18,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352435848] [2024-11-19 00:40:18,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:40:18,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:40:18,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:18,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:40:18,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:40:18,819 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand has 10 states, 8 states have (on average 9.25) internal successors, (74), 10 states have internal predecessors, (74), 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:40:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:19,293 INFO L93 Difference]: Finished difference Result 221 states and 298 transitions. [2024-11-19 00:40:19,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:40:19,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.25) internal successors, (74), 10 states have internal predecessors, (74), 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 131 [2024-11-19 00:40:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:19,304 INFO L225 Difference]: With dead ends: 221 [2024-11-19 00:40:19,304 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 00:40:19,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:40:19,305 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 136 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:19,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 461 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:40:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 00:40:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2024-11-19 00:40:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 149 transitions. [2024-11-19 00:40:19,330 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 149 transitions. Word has length 131 [2024-11-19 00:40:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:19,330 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 149 transitions. [2024-11-19 00:40:19,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.25) internal successors, (74), 10 states have internal predecessors, (74), 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:40:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 149 transitions. [2024-11-19 00:40:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:40:19,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:19,332 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:19,346 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 (11)] Forceful destruction successful, exit code 0 [2024-11-19 00:40:19,533 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:40:19,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:19,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1367013794, now seen corresponding path program 1 times [2024-11-19 00:40:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119870190] [2024-11-19 00:40:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:19,534 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:40:19,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:19,536 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:40:19,536 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:40:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:19,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:40:19,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:19,884 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 19 treesize of output 13 [2024-11-19 00:40:19,888 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 13 treesize of output 9 [2024-11-19 00:40:19,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:19,988 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 42 treesize of output 18 [2024-11-19 00:40:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:40:20,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:20,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:20,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119870190] [2024-11-19 00:40:20,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119870190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:20,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:20,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551908947] [2024-11-19 00:40:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:20,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:20,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:20,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:20,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:20,033 INFO L87 Difference]: Start difference. First operand 112 states and 149 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:20,868 INFO L93 Difference]: Finished difference Result 306 states and 408 transitions. [2024-11-19 00:40:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:20,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 131 [2024-11-19 00:40:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:20,871 INFO L225 Difference]: With dead ends: 306 [2024-11-19 00:40:20,871 INFO L226 Difference]: Without dead ends: 197 [2024-11-19 00:40:20,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:20,872 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 231 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:20,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 398 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:40:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-19 00:40:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 112. [2024-11-19 00:40:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2024-11-19 00:40:20,885 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 131 [2024-11-19 00:40:20,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:20,885 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2024-11-19 00:40:20,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2024-11-19 00:40:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:40:20,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:20,887 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:20,902 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:40:21,087 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:40:21,088 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:21,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:21,089 INFO L85 PathProgramCache]: Analyzing trace with hash -995651179, now seen corresponding path program 1 times [2024-11-19 00:40:21,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:21,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587349602] [2024-11-19 00:40:21,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:21,090 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:40:21,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:21,093 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:40:21,094 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:40:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:21,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:40:21,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:21,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-19 00:40:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:40:21,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:21,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587349602] [2024-11-19 00:40:21,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587349602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:21,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:21,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806796786] [2024-11-19 00:40:21,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:21,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:21,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:21,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:21,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:21,551 INFO L87 Difference]: Start difference. First operand 112 states and 148 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:21,847 INFO L93 Difference]: Finished difference Result 283 states and 377 transitions. [2024-11-19 00:40:21,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:21,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 131 [2024-11-19 00:40:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:21,850 INFO L225 Difference]: With dead ends: 283 [2024-11-19 00:40:21,850 INFO L226 Difference]: Without dead ends: 174 [2024-11-19 00:40:21,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:40:21,851 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 119 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:21,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 840 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:40:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-19 00:40:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 115. [2024-11-19 00:40:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 98 states have internal predecessors, (123), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 151 transitions. [2024-11-19 00:40:21,864 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 151 transitions. Word has length 131 [2024-11-19 00:40:21,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:21,864 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 151 transitions. [2024-11-19 00:40:21,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 151 transitions. [2024-11-19 00:40:21,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:40:21,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:21,866 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:21,881 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:40:22,066 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:40:22,066 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:22,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1281141432, now seen corresponding path program 1 times [2024-11-19 00:40:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:22,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018407479] [2024-11-19 00:40:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:22,067 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:40:22,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:22,068 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:40:22,069 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:40:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:22,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:40:22,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:22,439 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 19 treesize of output 13 [2024-11-19 00:40:22,442 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 13 treesize of output 9 [2024-11-19 00:40:22,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:22,536 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 41 treesize of output 17 [2024-11-19 00:40:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:40:22,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:22,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:22,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018407479] [2024-11-19 00:40:22,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018407479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:22,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:22,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374960070] [2024-11-19 00:40:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:22,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:22,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:22,577 INFO L87 Difference]: Start difference. First operand 115 states and 151 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:23,618 INFO L93 Difference]: Finished difference Result 315 states and 415 transitions. [2024-11-19 00:40:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:23,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2024-11-19 00:40:23,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:23,621 INFO L225 Difference]: With dead ends: 315 [2024-11-19 00:40:23,621 INFO L226 Difference]: Without dead ends: 203 [2024-11-19 00:40:23,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:40:23,622 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 235 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:23,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 651 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 00:40:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-19 00:40:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2024-11-19 00:40:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 98 states have internal predecessors, (122), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 00:40:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2024-11-19 00:40:23,634 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 150 transitions. Word has length 133 [2024-11-19 00:40:23,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:23,635 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 150 transitions. [2024-11-19 00:40:23,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2024-11-19 00:40:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:40:23,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:23,637 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:23,651 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:40:23,837 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:40:23,837 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:23,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:23,838 INFO L85 PathProgramCache]: Analyzing trace with hash -934863736, now seen corresponding path program 1 times [2024-11-19 00:40:23,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:23,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921062806] [2024-11-19 00:40:23,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:23,839 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:40:23,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:23,842 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:40:23,843 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:40:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:24,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 00:40:24,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:24,503 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:40:24,507 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 19 treesize of output 19 [2024-11-19 00:40:24,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:24,580 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 57 treesize of output 27 [2024-11-19 00:40:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:40:24,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:24,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:24,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921062806] [2024-11-19 00:40:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921062806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:24,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:24,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277319509] [2024-11-19 00:40:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:24,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:24,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:24,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:24,610 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:24,892 INFO L93 Difference]: Finished difference Result 174 states and 228 transitions. [2024-11-19 00:40:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:24,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2024-11-19 00:40:24,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:24,894 INFO L225 Difference]: With dead ends: 174 [2024-11-19 00:40:24,894 INFO L226 Difference]: Without dead ends: 172 [2024-11-19 00:40:24,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:40:24,895 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 105 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:24,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 818 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:40:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-19 00:40:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2024-11-19 00:40:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 140 states have (on average 1.2357142857142858) internal successors, (173), 141 states have internal predecessors, (173), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 00:40:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 225 transitions. [2024-11-19 00:40:24,914 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 225 transitions. Word has length 133 [2024-11-19 00:40:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:24,915 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 225 transitions. [2024-11-19 00:40:24,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 225 transitions. [2024-11-19 00:40:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:40:24,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:24,917 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:24,936 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 (15)] Forceful destruction successful, exit code 0 [2024-11-19 00:40:25,119 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:40:25,120 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:25,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash -933016694, now seen corresponding path program 1 times [2024-11-19 00:40:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:25,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300632933] [2024-11-19 00:40:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:25,121 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:40:25,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:25,124 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:40:25,125 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:40:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:25,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:40:25,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:25,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-19 00:40:25,704 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 37 treesize of output 36 [2024-11-19 00:40:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 00:40:25,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:25,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:25,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300632933] [2024-11-19 00:40:25,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300632933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:25,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:25,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016309824] [2024-11-19 00:40:25,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:25,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:25,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:40:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:25,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:25,927 INFO L87 Difference]: Start difference. First operand 171 states and 225 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:26,411 INFO L93 Difference]: Finished difference Result 300 states and 389 transitions. [2024-11-19 00:40:26,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:26,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2024-11-19 00:40:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:26,414 INFO L225 Difference]: With dead ends: 300 [2024-11-19 00:40:26,414 INFO L226 Difference]: Without dead ends: 181 [2024-11-19 00:40:26,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:40:26,415 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 189 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:26,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 642 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:40:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-19 00:40:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2024-11-19 00:40:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 145 states have (on average 1.2206896551724138) internal successors, (177), 146 states have internal predecessors, (177), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:40:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 233 transitions. [2024-11-19 00:40:26,437 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 233 transitions. Word has length 133 [2024-11-19 00:40:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:26,437 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 233 transitions. [2024-11-19 00:40:26,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 00:40:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 233 transitions. [2024-11-19 00:40:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:40:26,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:26,438 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:26,453 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:40:26,642 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:40:26,643 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:26,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash 841990668, now seen corresponding path program 1 times [2024-11-19 00:40:26,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:40:26,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364398460] [2024-11-19 00:40:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:26,644 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:40:26,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:40:26,645 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:40:26,646 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:40:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:27,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 00:40:27,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:27,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 00:40:27,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-19 00:40:27,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 65 [2024-11-19 00:40:27,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:27,892 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 125 treesize of output 56 [2024-11-19 00:40:28,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:28,060 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 219 treesize of output 75 [2024-11-19 00:40:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-19 00:40:28,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:40:28,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:40:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364398460] [2024-11-19 00:40:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364398460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1320081859] [2024-11-19 00:40:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:28,393 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:40:28,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:40:28,396 INFO L229 MonitoredProcess]: Starting monitored process 18 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:40:28,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-19 00:40:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:30,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-19 00:40:30,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:31,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 15 treesize of output 1 [2024-11-19 00:40:32,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-19 00:40:33,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 59 [2024-11-19 00:40:36,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:36,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 115 [2024-11-19 00:40:36,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:36,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 274 treesize of output 155