./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.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 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:17:56,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:17:56,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:17:56,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:17:56,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:17:56,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:17:56,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:17:56,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:17:57,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:17:57,000 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:17:57,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:17:57,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:17:57,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:17:57,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:17:57,003 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:17:57,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:17:57,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:17:57,004 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:17:57,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:17:57,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:17:57,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:17:57,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:17:57,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:17:57,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:17:57,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:17:57,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:17:57,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:17:57,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:17:57,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:17:57,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:17:57,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:17:57,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:17:57,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:17:57,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:17:57,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:17:57,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:17:57,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:17:57,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:17:57,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:17:57,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:17:57,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:17:57,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:17:57,011 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 -> 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c [2024-10-24 11:17:57,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:17:57,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:17:57,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:17:57,316 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:17:57,317 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:17:57,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2024-10-24 11:17:58,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:17:59,021 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:17:59,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2024-10-24 11:17:59,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adda5090a/5699179326554b2bbac35fff1246e691/FLAG8dd7fee37 [2024-10-24 11:17:59,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adda5090a/5699179326554b2bbac35fff1246e691 [2024-10-24 11:17:59,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:17:59,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:17:59,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:17:59,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:17:59,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:17:59,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38dec4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59, skipping insertion in model container [2024-10-24 11:17:59,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:17:59,286 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i[916,929] [2024-10-24 11:17:59,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:17:59,375 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:17:59,391 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i[916,929] [2024-10-24 11:17:59,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:17:59,466 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:17:59,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59 WrapperNode [2024-10-24 11:17:59,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:17:59,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:17:59,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:17:59,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:17:59,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,527 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2024-10-24 11:17:59,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:17:59,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:17:59,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:17:59,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:17:59,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,582 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 33, 41, 7, 13, 19]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 3, 1, 2, 2]. The 16 writes are split as follows [0, 7, 4, 1, 2, 2]. [2024-10-24 11:17:59,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:17:59,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:17:59,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:17:59,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:17:59,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (1/1) ... [2024-10-24 11:17:59,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:17:59,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:17:59,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:17:59,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:17:59,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:17:59,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:17:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:17:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:17:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:17:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:17:59,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:17:59,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:17:59,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:17:59,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:17:59,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:17:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:17:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:17:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:17:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:17:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:17:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:17:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:17:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:17:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:17:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:17:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:17:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:17:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:17:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:17:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:17:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:17:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:17:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:17:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:17:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:17:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:17:59,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:17:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:17:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:17:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:17:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:17:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:17:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:17:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:17:59,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:17:59,906 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:17:59,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:18:00,375 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-24 11:18:00,375 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:18:00,416 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:18:00,416 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:18:00,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:18:00 BoogieIcfgContainer [2024-10-24 11:18:00,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:18:00,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:18:00,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:18:00,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:18:00,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:17:59" (1/3) ... [2024-10-24 11:18:00,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db0c991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:18:00, skipping insertion in model container [2024-10-24 11:18:00,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:59" (2/3) ... [2024-10-24 11:18:00,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db0c991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:18:00, skipping insertion in model container [2024-10-24 11:18:00,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:18:00" (3/3) ... [2024-10-24 11:18:00,425 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-54.i [2024-10-24 11:18:00,441 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:18:00,442 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:18:00,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:18:00,513 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;@652df4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:18:00,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:18:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:18:00,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:00,533 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:00,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:00,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:00,541 INFO L85 PathProgramCache]: Analyzing trace with hash -146586112, now seen corresponding path program 1 times [2024-10-24 11:18:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:00,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114582511] [2024-10-24 11:18:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:00,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:00,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114582511] [2024-10-24 11:18:00,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114582511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:00,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:00,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:18:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125122549] [2024-10-24 11:18:00,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:00,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:18:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:00,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:18:00,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:18:00,965 INFO L87 Difference]: Start difference. First operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:01,012 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2024-10-24 11:18:01,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:18:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-24 11:18:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:01,023 INFO L225 Difference]: With dead ends: 203 [2024-10-24 11:18:01,024 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 11:18:01,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:18:01,030 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:01,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:18:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 11:18:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 11:18:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-10-24 11:18:01,095 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 100 [2024-10-24 11:18:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:01,096 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-10-24 11:18:01,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-10-24 11:18:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:18:01,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:01,105 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:01,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:18:01,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:01,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:01,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1921059756, now seen corresponding path program 1 times [2024-10-24 11:18:01,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:01,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383958080] [2024-10-24 11:18:01,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:01,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:01,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383958080] [2024-10-24 11:18:01,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383958080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:01,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:01,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:18:01,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115910077] [2024-10-24 11:18:01,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:01,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:18:01,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:18:01,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:01,532 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:01,589 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2024-10-24 11:18:01,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:18:01,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-10-24 11:18:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:01,592 INFO L225 Difference]: With dead ends: 203 [2024-10-24 11:18:01,593 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 11:18:01,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:01,596 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:01,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:18:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 11:18:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 11:18:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-24 11:18:01,609 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 100 [2024-10-24 11:18:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:01,612 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-24 11:18:01,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-24 11:18:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:18:01,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:01,615 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:01,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:18:01,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:01,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash -154964975, now seen corresponding path program 1 times [2024-10-24 11:18:01,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:01,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418248045] [2024-10-24 11:18:01,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:01,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:01,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:01,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418248045] [2024-10-24 11:18:01,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418248045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:01,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:01,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:18:01,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572167898] [2024-10-24 11:18:01,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:01,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:18:01,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:01,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:18:01,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:01,846 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:01,890 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2024-10-24 11:18:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:18:01,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-24 11:18:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:01,894 INFO L225 Difference]: With dead ends: 208 [2024-10-24 11:18:01,894 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:18:01,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:01,896 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:01,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:18:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:18:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-24 11:18:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2024-10-24 11:18:01,913 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 102 [2024-10-24 11:18:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:01,913 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2024-10-24 11:18:01,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2024-10-24 11:18:01,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:18:01,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:01,915 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:01,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:18:01,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:01,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash -97706673, now seen corresponding path program 1 times [2024-10-24 11:18:01,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:01,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87963488] [2024-10-24 11:18:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:01,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:02,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:02,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87963488] [2024-10-24 11:18:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87963488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:02,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:02,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:18:02,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968389381] [2024-10-24 11:18:02,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:02,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:18:02,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:02,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:18:02,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:02,089 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:02,125 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2024-10-24 11:18:02,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:18:02,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-24 11:18:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:02,130 INFO L225 Difference]: With dead ends: 212 [2024-10-24 11:18:02,133 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 11:18:02,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:02,135 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:02,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:18:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 11:18:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-24 11:18:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-10-24 11:18:02,150 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 102 [2024-10-24 11:18:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:02,150 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-10-24 11:18:02,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-10-24 11:18:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:18:02,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:02,153 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:02,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:18:02,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:02,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash -97647091, now seen corresponding path program 1 times [2024-10-24 11:18:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:02,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837854147] [2024-10-24 11:18:02,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:02,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:02,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837854147] [2024-10-24 11:18:02,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837854147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:02,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:02,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:02,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906220969] [2024-10-24 11:18:02,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:02,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:02,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:02,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:02,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:02,407 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:02,561 INFO L93 Difference]: Finished difference Result 312 states and 455 transitions. [2024-10-24 11:18:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:02,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-24 11:18:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:02,564 INFO L225 Difference]: With dead ends: 312 [2024-10-24 11:18:02,564 INFO L226 Difference]: Without dead ends: 206 [2024-10-24 11:18:02,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:02,567 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 131 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:02,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 524 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-24 11:18:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 128. [2024-10-24 11:18:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 114 states have (on average 1.4473684210526316) internal successors, (165), 114 states have internal predecessors, (165), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 189 transitions. [2024-10-24 11:18:02,582 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 189 transitions. Word has length 102 [2024-10-24 11:18:02,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:02,582 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 189 transitions. [2024-10-24 11:18:02,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:02,583 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 189 transitions. [2024-10-24 11:18:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:18:02,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:02,584 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:02,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:18:02,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:02,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash -39415404, now seen corresponding path program 1 times [2024-10-24 11:18:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:02,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132767790] [2024-10-24 11:18:02,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:02,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:02,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132767790] [2024-10-24 11:18:02,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132767790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:02,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:02,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:18:02,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668822323] [2024-10-24 11:18:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:02,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:18:02,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:02,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:18:02,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:02,933 INFO L87 Difference]: Start difference. First operand 128 states and 189 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:03,004 INFO L93 Difference]: Finished difference Result 357 states and 525 transitions. [2024-10-24 11:18:03,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:18:03,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-24 11:18:03,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:03,006 INFO L225 Difference]: With dead ends: 357 [2024-10-24 11:18:03,006 INFO L226 Difference]: Without dead ends: 230 [2024-10-24 11:18:03,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-10-24 11:18:03,008 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 108 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:03,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 398 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-24 11:18:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2024-10-24 11:18:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.4271356783919598) internal successors, (284), 199 states have internal predecessors, (284), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:18:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2024-10-24 11:18:03,023 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 103 [2024-10-24 11:18:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:03,024 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2024-10-24 11:18:03,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2024-10-24 11:18:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:18:03,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:03,025 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:03,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:18:03,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:03,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:03,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1728359146, now seen corresponding path program 1 times [2024-10-24 11:18:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:03,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62735788] [2024-10-24 11:18:03,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:03,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:03,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:03,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62735788] [2024-10-24 11:18:03,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62735788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:03,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:03,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:03,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262596812] [2024-10-24 11:18:03,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:03,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:03,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:03,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:03,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:03,373 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:03,506 INFO L93 Difference]: Finished difference Result 455 states and 667 transitions. [2024-10-24 11:18:03,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:03,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-24 11:18:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:03,510 INFO L225 Difference]: With dead ends: 455 [2024-10-24 11:18:03,510 INFO L226 Difference]: Without dead ends: 230 [2024-10-24 11:18:03,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:03,511 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 100 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:03,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 504 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-24 11:18:03,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2024-10-24 11:18:03,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.4221105527638191) internal successors, (283), 199 states have internal predecessors, (283), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:18:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 331 transitions. [2024-10-24 11:18:03,539 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 331 transitions. Word has length 103 [2024-10-24 11:18:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:03,543 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 331 transitions. [2024-10-24 11:18:03,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 331 transitions. [2024-10-24 11:18:03,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:18:03,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:03,545 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:03,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:18:03,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:03,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1470193708, now seen corresponding path program 1 times [2024-10-24 11:18:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:03,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017628489] [2024-10-24 11:18:03,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:04,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:04,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017628489] [2024-10-24 11:18:04,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017628489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:04,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:04,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:18:04,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271017275] [2024-10-24 11:18:04,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:04,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:18:04,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:04,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:18:04,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:18:04,543 INFO L87 Difference]: Start difference. First operand 226 states and 331 transitions. Second operand has 8 states, 6 states have (on average 7.666666666666667) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:18:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:04,803 INFO L93 Difference]: Finished difference Result 561 states and 808 transitions. [2024-10-24 11:18:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:18:04,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.666666666666667) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-24 11:18:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:04,806 INFO L225 Difference]: With dead ends: 561 [2024-10-24 11:18:04,806 INFO L226 Difference]: Without dead ends: 336 [2024-10-24 11:18:04,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:18:04,808 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 63 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:04,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 869 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:18:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-24 11:18:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 332. [2024-10-24 11:18:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 299 states have (on average 1.394648829431438) internal successors, (417), 301 states have internal predecessors, (417), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:18:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 473 transitions. [2024-10-24 11:18:04,836 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 473 transitions. Word has length 103 [2024-10-24 11:18:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:04,837 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 473 transitions. [2024-10-24 11:18:04,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.666666666666667) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:18:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 473 transitions. [2024-10-24 11:18:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:18:04,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:04,839 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:04,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:18:04,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:04,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:04,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1727387092, now seen corresponding path program 1 times [2024-10-24 11:18:04,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:04,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130573783] [2024-10-24 11:18:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:04,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:05,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:05,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130573783] [2024-10-24 11:18:05,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130573783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:05,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505228339] [2024-10-24 11:18:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:05,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:05,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:05,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:05,312 INFO L87 Difference]: Start difference. First operand 332 states and 473 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:05,517 INFO L93 Difference]: Finished difference Result 708 states and 1009 transitions. [2024-10-24 11:18:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:05,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-10-24 11:18:05,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:05,525 INFO L225 Difference]: With dead ends: 708 [2024-10-24 11:18:05,525 INFO L226 Difference]: Without dead ends: 525 [2024-10-24 11:18:05,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:05,528 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 129 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:05,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 876 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:18:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-10-24 11:18:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 521. [2024-10-24 11:18:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 462 states have (on average 1.3852813852813852) internal successors, (640), 467 states have internal predecessors, (640), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:18:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 740 transitions. [2024-10-24 11:18:05,567 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 740 transitions. Word has length 104 [2024-10-24 11:18:05,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:05,567 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 740 transitions. [2024-10-24 11:18:05,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 740 transitions. [2024-10-24 11:18:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:18:05,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:05,569 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:05,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:18:05,570 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:05,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:05,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1140581078, now seen corresponding path program 1 times [2024-10-24 11:18:05,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:05,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928059670] [2024-10-24 11:18:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:05,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:06,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:06,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928059670] [2024-10-24 11:18:06,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928059670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:06,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:06,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:18:06,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000201509] [2024-10-24 11:18:06,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:06,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:18:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:06,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:18:06,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:18:06,082 INFO L87 Difference]: Start difference. First operand 521 states and 740 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:06,359 INFO L93 Difference]: Finished difference Result 1008 states and 1435 transitions. [2024-10-24 11:18:06,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:18:06,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-24 11:18:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:06,364 INFO L225 Difference]: With dead ends: 1008 [2024-10-24 11:18:06,364 INFO L226 Difference]: Without dead ends: 674 [2024-10-24 11:18:06,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:18:06,366 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 138 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:06,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1934 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:18:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-10-24 11:18:06,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 665. [2024-10-24 11:18:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 590 states have (on average 1.38135593220339) internal successors, (815), 596 states have internal predecessors, (815), 64 states have call successors, (64), 10 states have call predecessors, (64), 10 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 11:18:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 943 transitions. [2024-10-24 11:18:06,408 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 943 transitions. Word has length 104 [2024-10-24 11:18:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:06,408 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 943 transitions. [2024-10-24 11:18:06,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 943 transitions. [2024-10-24 11:18:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:18:06,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:06,411 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:06,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:18:06,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:06,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash -762141870, now seen corresponding path program 1 times [2024-10-24 11:18:06,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:06,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642885409] [2024-10-24 11:18:06,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:06,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:07,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:07,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642885409] [2024-10-24 11:18:07,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642885409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:07,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:07,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:18:07,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841920697] [2024-10-24 11:18:07,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:07,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:18:07,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:07,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:18:07,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:18:07,125 INFO L87 Difference]: Start difference. First operand 665 states and 943 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:07,741 INFO L93 Difference]: Finished difference Result 1268 states and 1801 transitions. [2024-10-24 11:18:07,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 11:18:07,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-10-24 11:18:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:07,746 INFO L225 Difference]: With dead ends: 1268 [2024-10-24 11:18:07,747 INFO L226 Difference]: Without dead ends: 790 [2024-10-24 11:18:07,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:18:07,749 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 218 mSDsluCounter, 2539 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:07,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 2876 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:18:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-10-24 11:18:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 519. [2024-10-24 11:18:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 460 states have (on average 1.376086956521739) internal successors, (633), 465 states have internal predecessors, (633), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:18:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 733 transitions. [2024-10-24 11:18:07,785 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 733 transitions. Word has length 104 [2024-10-24 11:18:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:07,786 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 733 transitions. [2024-10-24 11:18:07,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 733 transitions. [2024-10-24 11:18:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:18:07,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:07,788 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:07,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:18:07,788 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:07,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1348947884, now seen corresponding path program 1 times [2024-10-24 11:18:07,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:07,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301293207] [2024-10-24 11:18:07,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:07,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:08,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:08,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301293207] [2024-10-24 11:18:08,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301293207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:08,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:08,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:08,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938799120] [2024-10-24 11:18:08,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:08,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:08,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:08,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:08,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:08,182 INFO L87 Difference]: Start difference. First operand 519 states and 733 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:08,363 INFO L93 Difference]: Finished difference Result 967 states and 1366 transitions. [2024-10-24 11:18:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:08,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-10-24 11:18:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:08,368 INFO L225 Difference]: With dead ends: 967 [2024-10-24 11:18:08,369 INFO L226 Difference]: Without dead ends: 635 [2024-10-24 11:18:08,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-10-24 11:18:08,371 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 127 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:08,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1015 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-24 11:18:08,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 511. [2024-10-24 11:18:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 452 states have (on average 1.3738938053097345) internal successors, (621), 457 states have internal predecessors, (621), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:18:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 721 transitions. [2024-10-24 11:18:08,411 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 721 transitions. Word has length 104 [2024-10-24 11:18:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:08,411 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 721 transitions. [2024-10-24 11:18:08,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 721 transitions. [2024-10-24 11:18:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:18:08,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:08,413 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:08,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:18:08,414 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:08,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1768804226, now seen corresponding path program 1 times [2024-10-24 11:18:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:08,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723858920] [2024-10-24 11:18:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:18:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:18:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:18:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:18:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:18:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:18:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:18:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:18:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:18:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:18:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:18:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:18:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:08,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:18:08,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723858920] [2024-10-24 11:18:08,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723858920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:08,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:08,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:08,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717616733] [2024-10-24 11:18:08,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:08,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:08,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:18:08,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:08,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:08,738 INFO L87 Difference]: Start difference. First operand 511 states and 721 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:08,809 INFO L93 Difference]: Finished difference Result 537 states and 749 transitions. [2024-10-24 11:18:08,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:08,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-10-24 11:18:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:08,812 INFO L225 Difference]: With dead ends: 537 [2024-10-24 11:18:08,812 INFO L226 Difference]: Without dead ends: 535 [2024-10-24 11:18:08,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-10-24 11:18:08,813 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 116 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:08,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 594 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:18:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-24 11:18:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2024-10-24 11:18:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 473 states have (on average 1.357293868921776) internal successors, (642), 478 states have internal predecessors, (642), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:18:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 742 transitions. [2024-10-24 11:18:08,870 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 742 transitions. Word has length 105 [2024-10-24 11:18:08,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:08,870 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 742 transitions. [2024-10-24 11:18:08,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:08,870 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 742 transitions. [2024-10-24 11:18:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:18:08,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:08,872 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:08,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:18:08,872 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:08,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1768863808, now seen corresponding path program 1 times [2024-10-24 11:18:08,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:18:08,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246048189] [2024-10-24 11:18:08,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:08,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:18:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:18:08,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:18:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:18:09,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:18:09,030 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:18:09,031 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:18:09,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:18:09,036 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:09,135 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:18:09,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:18:09 BoogieIcfgContainer [2024-10-24 11:18:09,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:18:09,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:18:09,140 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:18:09,140 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:18:09,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:18:00" (3/4) ... [2024-10-24 11:18:09,142 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:18:09,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:18:09,144 INFO L158 Benchmark]: Toolchain (without parser) took 10090.69ms. Allocated memory was 182.5MB in the beginning and 358.6MB in the end (delta: 176.2MB). Free memory was 128.8MB in the beginning and 278.1MB in the end (delta: -149.3MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-10-24 11:18:09,144 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:18:09,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.22ms. Allocated memory is still 182.5MB. Free memory was 128.8MB in the beginning and 112.4MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:18:09,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.74ms. Allocated memory is still 182.5MB. Free memory was 112.4MB in the beginning and 108.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:18:09,144 INFO L158 Benchmark]: Boogie Preprocessor took 96.41ms. Allocated memory is still 182.5MB. Free memory was 108.7MB in the beginning and 103.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:18:09,145 INFO L158 Benchmark]: RCFGBuilder took 791.03ms. Allocated memory is still 182.5MB. Free memory was 103.6MB in the beginning and 118.2MB in the end (delta: -14.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-24 11:18:09,145 INFO L158 Benchmark]: TraceAbstraction took 8721.13ms. Allocated memory was 182.5MB in the beginning and 358.6MB in the end (delta: 176.2MB). Free memory was 117.1MB in the beginning and 278.1MB in the end (delta: -161.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-10-24 11:18:09,145 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 358.6MB. Free memory is still 278.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:18:09,146 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.17ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.22ms. Allocated memory is still 182.5MB. Free memory was 128.8MB in the beginning and 112.4MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.74ms. Allocated memory is still 182.5MB. Free memory was 112.4MB in the beginning and 108.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.41ms. Allocated memory is still 182.5MB. Free memory was 108.7MB in the beginning and 103.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 791.03ms. Allocated memory is still 182.5MB. Free memory was 103.6MB in the beginning and 118.2MB in the end (delta: -14.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8721.13ms. Allocated memory was 182.5MB in the beginning and 358.6MB in the end (delta: 176.2MB). Free memory was 117.1MB in the beginning and 278.1MB in the end (delta: -161.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 358.6MB. Free memory is still 278.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L25-L27] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L28-L30] float float_Array_0[1] = { 9.8 }; [L28-L30] float float_Array_0[1] = { 9.8 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L31-L33] signed char signed_char_Array_0[2] = { 2, 25 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L72] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] double_Array_0[1] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] RET updateVariables() [L104] CALL step() [L40] EXPR double_Array_0[0] [L40] float_Array_0[0] = double_Array_0[0] [L41] EXPR signed_char_Array_0[0] [L41] signed_char_Array_0[1] = signed_char_Array_0[0] [L42] signed long int stepLocal_0 = -4; [L43] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L43] COND FALSE !(stepLocal_0 >= signed_char_Array_0[1]) [L46] EXPR unsigned_char_Array_0[0] [L46] unsigned char stepLocal_2 = unsigned_char_Array_0[0]; [L47] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L47] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L56] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) [L56] EXPR unsigned_char_Array_0[1] [L56] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, stepLocal_2=254, unsigned_char_Array_0={8:0}] [L56] signed long int stepLocal_1 = (((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])); [L57] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L57] COND FALSE !((8 * unsigned_char_Array_0[1]) == stepLocal_1) [L68] EXPR BOOL_unsigned_char_Array_0[1][0] [L68] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][0] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 [L95] EXPR (-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) [L95] EXPR unsigned_char_Array_0[1] [L95] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) [L95] EXPR unsigned_char_Array_0[1] [L95] EXPR ((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) [L95] EXPR BOOL_unsigned_char_Array_0[1][1] [L95] EXPR BOOL_unsigned_char_Array_0[1][0] [L95] EXPR ((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) [L95] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1 [L95] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) [L95] EXPR float_Array_0[0] [L95] EXPR double_Array_0[0] [L95] EXPR ((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95-L96] return (((((-4 >= signed_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (((((1) < 0 ) ? -(1) : (1))))) ? (unsigned_char_Array_0[0]) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * unsigned_char_Array_0[1]) == ((((10) > (unsigned_char_Array_0[1])) ? (10) : (unsigned_char_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((double_Array_0[2] < float_Array_0[0]) && BOOL_unsigned_char_Array_0[0][0]))) : ((float_Array_0[0] >= ((((double_Array_0[2]) < 0 ) ? -(double_Array_0[2]) : (double_Array_0[2])))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])))) && (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_char_Array_0[0] > signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) ((((((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) > (double_Array_0[1])) ? (((((double_Array_0[0]) > (16.5)) ? (double_Array_0[0]) : (16.5)))) : (double_Array_0[1]))))) : (BOOL_unsigned_char_Array_0[1][0] ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) : 1)) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 14, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1137 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1132 mSDsluCounter, 11009 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8640 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1677 IncrementalHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 2369 mSDtfsCounter, 1677 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=665occurred in iteration=10, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 500 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1441 NumberOfCodeBlocks, 1441 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 3034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 3432/3432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:18:09,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.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 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:18:11,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:18:11,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:18:11,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:18:11,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:18:11,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:18:11,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:18:11,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:18:11,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:18:11,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:18:11,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:18:11,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:18:11,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:18:11,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:18:11,540 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:18:11,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:18:11,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:18:11,541 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:18:11,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:18:11,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:18:11,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:18:11,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:18:11,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:18:11,547 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:18:11,547 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:18:11,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:18:11,548 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:18:11,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:18:11,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:18:11,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:18:11,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:18:11,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:18:11,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:18:11,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:18:11,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:18:11,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:18:11,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:18:11,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:18:11,551 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:18:11,552 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:18:11,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:18:11,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:18:11,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:18:11,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:18:11,553 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:18:11,553 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 -> 2f657570a1e1457f1f304b0d552f8742bb723e9b2810b7fa1033cb000332d16c [2024-10-24 11:18:11,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:18:11,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:18:11,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:18:11,921 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:18:11,922 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:18:11,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2024-10-24 11:18:13,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:18:13,627 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:18:13,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i [2024-10-24 11:18:13,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/741b1dc2c/5e13db9cc2b34e7b90f21c67e1b22e8b/FLAG1491b7f6a [2024-10-24 11:18:13,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/741b1dc2c/5e13db9cc2b34e7b90f21c67e1b22e8b [2024-10-24 11:18:13,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:18:13,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:18:13,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:18:13,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:18:13,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:18:13,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:18:13" (1/1) ... [2024-10-24 11:18:13,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278ddf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:13, skipping insertion in model container [2024-10-24 11:18:13,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:18:13" (1/1) ... [2024-10-24 11:18:13,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:18:13,881 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i[916,929] [2024-10-24 11:18:13,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:18:13,999 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:18:14,013 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-54.i[916,929] [2024-10-24 11:18:14,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:18:14,076 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:18:14,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14 WrapperNode [2024-10-24 11:18:14,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:18:14,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:18:14,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:18:14,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:18:14,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,149 INFO L138 Inliner]: procedures = 33, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 469 [2024-10-24 11:18:14,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:18:14,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:18:14,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:18:14,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:18:14,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,219 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 33, 41, 7, 13, 19]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 3, 1, 2, 2]. The 16 writes are split as follows [0, 7, 4, 1, 2, 2]. [2024-10-24 11:18:14,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:18:14,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:18:14,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:18:14,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:18:14,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (1/1) ... [2024-10-24 11:18:14,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:18:14,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:18:14,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:18:14,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:18:14,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:18:14,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:18:14,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:18:14,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-24 11:18:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-24 11:18:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-24 11:18:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-24 11:18:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:18:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:18:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:18:14,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-24 11:18:14,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-24 11:18:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-24 11:18:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-24 11:18:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:18:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:18:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:18:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:18:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:18:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:18:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:18:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:18:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:18:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:18:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:18:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:18:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:18:14,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:18:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:18:14,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:18:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:18:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:18:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:18:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:18:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:18:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:18:14,598 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:18:14,601 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:18:15,894 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-24 11:18:15,894 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:18:15,948 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:18:15,949 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:18:15,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:18:15 BoogieIcfgContainer [2024-10-24 11:18:15,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:18:15,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:18:15,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:18:15,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:18:15,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:18:13" (1/3) ... [2024-10-24 11:18:15,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b30013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:18:15, skipping insertion in model container [2024-10-24 11:18:15,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:18:14" (2/3) ... [2024-10-24 11:18:15,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b30013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:18:15, skipping insertion in model container [2024-10-24 11:18:15,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:18:15" (3/3) ... [2024-10-24 11:18:15,959 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-54.i [2024-10-24 11:18:15,975 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:18:15,975 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:18:16,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:18:16,058 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;@3353b335, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:18:16,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:18:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:18:16,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:16,080 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:16,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:16,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash -146586112, now seen corresponding path program 1 times [2024-10-24 11:18:16,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:16,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489125928] [2024-10-24 11:18:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:16,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:16,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:16,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:18:16,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:18:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:16,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:18:16,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-24 11:18:16,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:16,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:16,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489125928] [2024-10-24 11:18:16,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489125928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:16,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:16,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:18:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987150039] [2024-10-24 11:18:16,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:16,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:18:16,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:18:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:18:16,581 INFO L87 Difference]: Start difference. First operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:16,668 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2024-10-24 11:18:16,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:18:16,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-24 11:18:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:16,678 INFO L225 Difference]: With dead ends: 203 [2024-10-24 11:18:16,679 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 11:18:16,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:18:16,685 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:16,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 11:18:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 11:18:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-10-24 11:18:16,737 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 100 [2024-10-24 11:18:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:16,738 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-10-24 11:18:16,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-10-24 11:18:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:18:16,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:16,742 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:16,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:18:16,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:16,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:16,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1921059756, now seen corresponding path program 1 times [2024-10-24 11:18:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:16,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735009070] [2024-10-24 11:18:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:16,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:16,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:18:16,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:18:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:17,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:18:17,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:17,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:17,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:17,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735009070] [2024-10-24 11:18:17,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735009070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:17,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:17,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:18:17,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783082837] [2024-10-24 11:18:17,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:17,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:18:17,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:18:17,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:17,329 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:17,437 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2024-10-24 11:18:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:18:17,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-10-24 11:18:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:17,442 INFO L225 Difference]: With dead ends: 203 [2024-10-24 11:18:17,442 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 11:18:17,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:17,446 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:17,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:17,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 11:18:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 11:18:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-24 11:18:17,459 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 100 [2024-10-24 11:18:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:17,460 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-24 11:18:17,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-24 11:18:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:18:17,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:17,463 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:17,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:17,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:17,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:17,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:17,669 INFO L85 PathProgramCache]: Analyzing trace with hash -154964975, now seen corresponding path program 1 times [2024-10-24 11:18:17,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:17,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171175669] [2024-10-24 11:18:17,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:17,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:17,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:17,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:18:17,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:18:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:17,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:18:17,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:18,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:18,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:18,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171175669] [2024-10-24 11:18:18,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171175669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:18,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:18,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308156364] [2024-10-24 11:18:18,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:18,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:18,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:18,021 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:18,309 INFO L93 Difference]: Finished difference Result 210 states and 310 transitions. [2024-10-24 11:18:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:18,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-24 11:18:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:18,318 INFO L225 Difference]: With dead ends: 210 [2024-10-24 11:18:18,318 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 11:18:18,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:18,323 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:18,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 554 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:18:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 11:18:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-24 11:18:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-10-24 11:18:18,338 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 102 [2024-10-24 11:18:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:18,343 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-10-24 11:18:18,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-10-24 11:18:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:18:18,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:18,348 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:18,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:18:18,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:18,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:18,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash -97706673, now seen corresponding path program 1 times [2024-10-24 11:18:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771636672] [2024-10-24 11:18:18,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:18,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:18,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:18,559 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:18:18,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 (5)] Waiting until timeout for monitored process [2024-10-24 11:18:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:18,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:18:18,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:18,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:18,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771636672] [2024-10-24 11:18:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771636672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:18,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:18,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:18,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530045510] [2024-10-24 11:18:18,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:18,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:18,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:18,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:18,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:18,878 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:19,239 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-10-24 11:18:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:19,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-24 11:18:19,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:19,244 INFO L225 Difference]: With dead ends: 216 [2024-10-24 11:18:19,244 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 11:18:19,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:19,250 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:19,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 688 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:18:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 11:18:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-10-24 11:18:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2024-10-24 11:18:19,260 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 102 [2024-10-24 11:18:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:19,261 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2024-10-24 11:18:19,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2024-10-24 11:18:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:18:19,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:19,263 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:19,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 11:18:19,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:19,464 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:19,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:19,465 INFO L85 PathProgramCache]: Analyzing trace with hash -97647091, now seen corresponding path program 1 times [2024-10-24 11:18:19,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:19,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419239008] [2024-10-24 11:18:19,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:19,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:19,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:19,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:18:19,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:18:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:19,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:18:19,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:19,909 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 23 treesize of output 11 [2024-10-24 11:18:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:19,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:19,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:19,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419239008] [2024-10-24 11:18:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419239008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:19,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:19,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:19,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074845394] [2024-10-24 11:18:19,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:19,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:19,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:19,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:19,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:19,997 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:20,404 INFO L93 Difference]: Finished difference Result 316 states and 459 transitions. [2024-10-24 11:18:20,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:20,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-24 11:18:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:20,408 INFO L225 Difference]: With dead ends: 316 [2024-10-24 11:18:20,409 INFO L226 Difference]: Without dead ends: 208 [2024-10-24 11:18:20,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:20,412 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 131 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:20,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 524 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:18:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-24 11:18:20,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 130. [2024-10-24 11:18:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 116 states have (on average 1.4396551724137931) internal successors, (167), 116 states have internal predecessors, (167), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:18:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 191 transitions. [2024-10-24 11:18:20,437 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 191 transitions. Word has length 102 [2024-10-24 11:18:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:20,438 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 191 transitions. [2024-10-24 11:18:20,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 191 transitions. [2024-10-24 11:18:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:18:20,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:20,443 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:20,453 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-10-24 11:18:20,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:20,644 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:20,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash -39415404, now seen corresponding path program 1 times [2024-10-24 11:18:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:20,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720413029] [2024-10-24 11:18:20,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:20,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:20,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:20,648 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:18:20,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:18:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:20,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:18:20,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:21,269 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 26 treesize of output 14 [2024-10-24 11:18:21,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:18:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:21,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:21,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:21,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720413029] [2024-10-24 11:18:21,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720413029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:21,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:21,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:18:21,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310577372] [2024-10-24 11:18:21,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:21,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:18:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:21,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:18:21,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:18:21,364 INFO L87 Difference]: Start difference. First operand 130 states and 191 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:21,729 INFO L93 Difference]: Finished difference Result 361 states and 529 transitions. [2024-10-24 11:18:21,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:18:21,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-24 11:18:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:21,732 INFO L225 Difference]: With dead ends: 361 [2024-10-24 11:18:21,732 INFO L226 Difference]: Without dead ends: 232 [2024-10-24 11:18:21,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 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-10-24 11:18:21,736 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 93 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:21,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 398 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:18:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-24 11:18:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2024-10-24 11:18:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 201 states have (on average 1.4228855721393034) internal successors, (286), 201 states have internal predecessors, (286), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:18:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 334 transitions. [2024-10-24 11:18:21,761 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 334 transitions. Word has length 103 [2024-10-24 11:18:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:21,762 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 334 transitions. [2024-10-24 11:18:21,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 334 transitions. [2024-10-24 11:18:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:18:21,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:21,764 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:21,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:21,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:21,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:21,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:21,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1728359146, now seen corresponding path program 1 times [2024-10-24 11:18:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:21,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66225629] [2024-10-24 11:18:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:21,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:21,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:21,970 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:18:21,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 11:18:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:22,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:18:22,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:22,282 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 23 treesize of output 11 [2024-10-24 11:18:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:22,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:22,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66225629] [2024-10-24 11:18:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66225629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:22,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094274490] [2024-10-24 11:18:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:22,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:22,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:22,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:22,326 INFO L87 Difference]: Start difference. First operand 228 states and 334 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:23,462 INFO L93 Difference]: Finished difference Result 572 states and 838 transitions. [2024-10-24 11:18:23,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:23,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-24 11:18:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:23,465 INFO L225 Difference]: With dead ends: 572 [2024-10-24 11:18:23,465 INFO L226 Difference]: Without dead ends: 345 [2024-10-24 11:18:23,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:23,466 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 139 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:23,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 510 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 11:18:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-24 11:18:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 243. [2024-10-24 11:18:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 216 states have (on average 1.4259259259259258) internal successors, (308), 216 states have internal predecessors, (308), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:18:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 356 transitions. [2024-10-24 11:18:23,482 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 356 transitions. Word has length 103 [2024-10-24 11:18:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:23,483 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 356 transitions. [2024-10-24 11:18:23,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 356 transitions. [2024-10-24 11:18:23,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:18:23,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:23,484 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:23,493 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 (8)] Ended with exit code 0 [2024-10-24 11:18:23,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:23,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:23,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1470193708, now seen corresponding path program 1 times [2024-10-24 11:18:23,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:23,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098189057] [2024-10-24 11:18:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:23,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:23,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:23,688 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:18:23,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 11:18:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:23,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 11:18:23,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:24,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:18:24,186 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 42 treesize of output 20 [2024-10-24 11:18:24,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2024-10-24 11:18:24,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:24,732 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 88 treesize of output 40 [2024-10-24 11:18:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-24 11:18:24,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:18:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:24,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:24,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098189057] [2024-10-24 11:18:24,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098189057] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:18:24,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:18:24,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 16 [2024-10-24 11:18:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012223037] [2024-10-24 11:18:24,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:24,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:24,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:24,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:18:24,998 INFO L87 Difference]: Start difference. First operand 243 states and 356 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:25,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:25,721 INFO L93 Difference]: Finished difference Result 605 states and 871 transitions. [2024-10-24 11:18:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:25,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-24 11:18:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:25,724 INFO L225 Difference]: With dead ends: 605 [2024-10-24 11:18:25,724 INFO L226 Difference]: Without dead ends: 363 [2024-10-24 11:18:25,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:18:25,725 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 63 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:25,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 651 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:18:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-24 11:18:25,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2024-10-24 11:18:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 326 states have (on average 1.3957055214723926) internal successors, (455), 328 states have internal predecessors, (455), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:18:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 511 transitions. [2024-10-24 11:18:25,745 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 511 transitions. Word has length 103 [2024-10-24 11:18:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:25,746 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 511 transitions. [2024-10-24 11:18:25,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 511 transitions. [2024-10-24 11:18:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:18:25,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:25,748 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:25,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 11:18:25,948 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-10-24 11:18:25,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:25,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1727387092, now seen corresponding path program 1 times [2024-10-24 11:18:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:25,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990434549] [2024-10-24 11:18:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:25,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:25,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:25,951 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-10-24 11:18:25,952 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-10-24 11:18:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:26,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:18:26,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:26,295 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-10-24 11:18:26,407 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 34 treesize of output 29 [2024-10-24 11:18:26,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:26,578 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 28 treesize of output 14 [2024-10-24 11:18:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-24 11:18:26,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:26,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:26,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990434549] [2024-10-24 11:18:26,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990434549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:26,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:26,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:18:26,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492697494] [2024-10-24 11:18:26,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:26,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:18:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:26,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:18:26,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:26,613 INFO L87 Difference]: Start difference. First operand 359 states and 511 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:27,214 INFO L93 Difference]: Finished difference Result 1018 states and 1444 transitions. [2024-10-24 11:18:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:18:27,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-10-24 11:18:27,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:27,221 INFO L225 Difference]: With dead ends: 1018 [2024-10-24 11:18:27,221 INFO L226 Difference]: Without dead ends: 660 [2024-10-24 11:18:27,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:18:27,223 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 265 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:27,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 768 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:18:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-10-24 11:18:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 656. [2024-10-24 11:18:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 595 states have (on average 1.3831932773109243) internal successors, (823), 601 states have internal predecessors, (823), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 11:18:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 927 transitions. [2024-10-24 11:18:27,268 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 927 transitions. Word has length 104 [2024-10-24 11:18:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:27,268 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 927 transitions. [2024-10-24 11:18:27,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:18:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 927 transitions. [2024-10-24 11:18:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:18:27,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:27,271 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:27,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 11:18:27,471 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-10-24 11:18:27,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:27,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1140581078, now seen corresponding path program 1 times [2024-10-24 11:18:27,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:27,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993112521] [2024-10-24 11:18:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:27,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:27,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:27,476 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:18:27,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 11:18:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:27,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:18:27,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:27,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:18:27,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:18:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:27,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:27,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993112521] [2024-10-24 11:18:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993112521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:27,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:27,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:18:27,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617564773] [2024-10-24 11:18:27,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:27,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:18:27,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:27,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:18:27,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:18:27,928 INFO L87 Difference]: Start difference. First operand 656 states and 927 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:28,539 INFO L93 Difference]: Finished difference Result 1642 states and 2321 transitions. [2024-10-24 11:18:28,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:18:28,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-24 11:18:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:28,545 INFO L225 Difference]: With dead ends: 1642 [2024-10-24 11:18:28,545 INFO L226 Difference]: Without dead ends: 987 [2024-10-24 11:18:28,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 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-10-24 11:18:28,548 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 138 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:28,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1711 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:18:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-10-24 11:18:28,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 678. [2024-10-24 11:18:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 605 states have (on average 1.3801652892561984) internal successors, (835), 612 states have internal predecessors, (835), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 11:18:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 959 transitions. [2024-10-24 11:18:28,608 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 959 transitions. Word has length 104 [2024-10-24 11:18:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:28,608 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 959 transitions. [2024-10-24 11:18:28,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 959 transitions. [2024-10-24 11:18:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:18:28,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:28,610 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:28,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 11:18:28,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:28,814 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:28,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash -762141870, now seen corresponding path program 1 times [2024-10-24 11:18:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:28,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794345498] [2024-10-24 11:18:28,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:28,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:28,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:28,817 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:18:28,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 11:18:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:29,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 11:18:29,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:29,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-10-24 11:18:29,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:29,206 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 46 treesize of output 22 [2024-10-24 11:18:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:29,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:29,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794345498] [2024-10-24 11:18:29,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794345498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:29,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:29,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:18:29,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524792036] [2024-10-24 11:18:29,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:29,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:18:29,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:29,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:18:29,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:18:29,293 INFO L87 Difference]: Start difference. First operand 678 states and 959 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:30,006 INFO L93 Difference]: Finished difference Result 1559 states and 2200 transitions. [2024-10-24 11:18:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:18:30,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-24 11:18:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:30,012 INFO L225 Difference]: With dead ends: 1559 [2024-10-24 11:18:30,012 INFO L226 Difference]: Without dead ends: 920 [2024-10-24 11:18:30,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:18:30,015 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 127 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:30,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1846 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:18:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-24 11:18:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 658. [2024-10-24 11:18:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 585 states have (on average 1.3794871794871795) internal successors, (807), 592 states have internal predecessors, (807), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 11:18:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 931 transitions. [2024-10-24 11:18:30,093 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 931 transitions. Word has length 104 [2024-10-24 11:18:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:30,096 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 931 transitions. [2024-10-24 11:18:30,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 931 transitions. [2024-10-24 11:18:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:18:30,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:30,098 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:30,110 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 (12)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:30,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:30,299 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:30,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:30,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1768804226, now seen corresponding path program 1 times [2024-10-24 11:18:30,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:30,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223576186] [2024-10-24 11:18:30,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:30,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:30,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:30,301 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:18:30,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 11:18:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:30,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:18:30,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:30,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:18:30,726 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-10-24 11:18:30,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:30,807 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-10-24 11:18:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:18:30,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:30,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:30,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223576186] [2024-10-24 11:18:30,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223576186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:30,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:30,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:18:30,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282576406] [2024-10-24 11:18:30,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:30,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:30,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:30,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:30,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:18:30,830 INFO L87 Difference]: Start difference. First operand 658 states and 931 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:31,136 INFO L93 Difference]: Finished difference Result 692 states and 968 transitions. [2024-10-24 11:18:31,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:31,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-10-24 11:18:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:31,143 INFO L225 Difference]: With dead ends: 692 [2024-10-24 11:18:31,143 INFO L226 Difference]: Without dead ends: 690 [2024-10-24 11:18:31,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 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-10-24 11:18:31,144 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 116 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:31,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 594 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:18:31,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-24 11:18:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2024-10-24 11:18:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 613 states have (on average 1.3621533442088092) internal successors, (835), 620 states have internal predecessors, (835), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 11:18:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 959 transitions. [2024-10-24 11:18:31,207 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 959 transitions. Word has length 105 [2024-10-24 11:18:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:31,207 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 959 transitions. [2024-10-24 11:18:31,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:18:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 959 transitions. [2024-10-24 11:18:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:18:31,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:31,209 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:31,221 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 (13)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:31,409 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-10-24 11:18:31,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:31,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:31,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1768863808, now seen corresponding path program 1 times [2024-10-24 11:18:31,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:31,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132911741] [2024-10-24 11:18:31,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:31,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:18:31,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:31,413 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-10-24 11:18:31,414 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-10-24 11:18:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:32,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:18:32,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:32,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:18:32,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:32,681 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 121 treesize of output 77 [2024-10-24 11:18:38,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:18:55,186 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 203 treesize of output 167 [2024-10-24 11:18:55,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:55,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 287 treesize of output 125 [2024-10-24 11:18:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 11:18:55,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:55,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:55,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132911741] [2024-10-24 11:18:55,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132911741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:55,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:55,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:18:55,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535902837] [2024-10-24 11:18:55,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:55,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:18:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:55,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:18:55,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2024-10-24 11:18:55,801 INFO L87 Difference]: Start difference. First operand 690 states and 959 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:19:00,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:19:04,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:19:07,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:19:10,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:19:13,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:19:16,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]