./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-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-2.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 6c2afc665f9ec9bbf6f489827c9a63486fda067f850cc8b511cbd83d8b773bd8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:54:57,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:54:57,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:54:57,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:54:57,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:54:57,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:54:57,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:54:57,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:54:57,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:54:57,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:54:57,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:54:57,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:54:57,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:54:57,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:54:57,939 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:54:57,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:54:57,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:54:57,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:54:57,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:54:57,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:54:57,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:54:57,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:54:57,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:54:57,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:54:57,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:54:57,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:54:57,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:54:57,947 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:54:57,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:54:57,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:54:57,948 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:54:57,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:54:57,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:54:57,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:54:57,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:54:57,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:54:57,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:54:57,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:54:57,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:54:57,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:54:57,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:54:57,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:54:57,952 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 -> 6c2afc665f9ec9bbf6f489827c9a63486fda067f850cc8b511cbd83d8b773bd8 [2024-10-13 05:54:58,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:54:58,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:54:58,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:54:58,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:54:58,232 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:54:58,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.i [2024-10-13 05:54:59,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:54:59,931 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:54:59,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.i [2024-10-13 05:54:59,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293e47c2a/f85a574bcb0e486f8643eb48f1a319a6/FLAGdcc5cc181 [2024-10-13 05:54:59,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293e47c2a/f85a574bcb0e486f8643eb48f1a319a6 [2024-10-13 05:54:59,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:54:59,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:54:59,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:54:59,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:54:59,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:54:59,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:54:59" (1/1) ... [2024-10-13 05:54:59,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1349a800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:59, skipping insertion in model container [2024-10-13 05:54:59,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:54:59" (1/1) ... [2024-10-13 05:54:59,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:55:00,148 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-2.i[915,928] [2024-10-13 05:55:00,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:55:00,235 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:55:00,245 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-2.i[915,928] [2024-10-13 05:55:00,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:55:00,309 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:55:00,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00 WrapperNode [2024-10-13 05:55:00,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:55:00,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:55:00,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:55:00,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:55:00,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,383 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 514 [2024-10-13 05:55:00,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:55:00,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:55:00,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:55:00,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:55:00,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,427 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2024-10-13 05:55:00,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:55:00,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:55:00,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:55:00,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:55:00,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (1/1) ... [2024-10-13 05:55:00,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:55:00,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:55:00,527 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-13 05:55:00,532 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-13 05:55:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:55:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 05:55:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 05:55:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 05:55:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 05:55:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 05:55:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 05:55:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 05:55:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 05:55:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 05:55:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 05:55:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 05:55:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 05:55:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 05:55:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 05:55:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 05:55:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 05:55:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 05:55:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 05:55:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 05:55:00,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 05:55:00,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:55:00,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:55:00,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:55:00,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 05:55:00,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 05:55:00,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 05:55:00,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:55:00,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:55:00,759 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:55:00,762 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:55:01,411 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-13 05:55:01,411 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:55:01,450 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:55:01,451 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:55:01,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:55:01 BoogieIcfgContainer [2024-10-13 05:55:01,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:55:01,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:55:01,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:55:01,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:55:01,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:54:59" (1/3) ... [2024-10-13 05:55:01,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5063cf55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:55:01, skipping insertion in model container [2024-10-13 05:55:01,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:00" (2/3) ... [2024-10-13 05:55:01,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5063cf55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:55:01, skipping insertion in model container [2024-10-13 05:55:01,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:55:01" (3/3) ... [2024-10-13 05:55:01,463 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-2.i [2024-10-13 05:55:01,482 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:55:01,483 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:55:01,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:55:01,550 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;@14a11662, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:55:01,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:55:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 82 states have (on average 1.5) internal successors, (123), 83 states have internal predecessors, (123), 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-13 05:55:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 05:55:01,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:01,570 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] [2024-10-13 05:55:01,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:01,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:01,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1254188633, now seen corresponding path program 1 times [2024-10-13 05:55:01,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:01,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373349260] [2024-10-13 05:55:01,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,930 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-13 05:55:01,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:01,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373349260] [2024-10-13 05:55:01,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373349260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:01,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:01,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:55:01,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63630690] [2024-10-13 05:55:01,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:01,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:55:01,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:01,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:55:01,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:55:01,975 INFO L87 Difference]: Start difference. First operand has 97 states, 82 states have (on average 1.5) internal successors, (123), 83 states have internal predecessors, (123), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-13 05:55:02,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:02,025 INFO L93 Difference]: Finished difference Result 191 states and 304 transitions. [2024-10-13 05:55:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:55:02,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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 95 [2024-10-13 05:55:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:02,034 INFO L225 Difference]: With dead ends: 191 [2024-10-13 05:55:02,035 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 05:55:02,039 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-13 05:55:02,043 INFO L432 NwaCegarLoop]: 138 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, 138 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-13 05:55:02,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:55:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 05:55:02,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-13 05:55:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 81 states have internal predecessors, (118), 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-13 05:55:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2024-10-13 05:55:02,099 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 95 [2024-10-13 05:55:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:02,100 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2024-10-13 05:55:02,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-13 05:55:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2024-10-13 05:55:02,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 05:55:02,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:02,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] [2024-10-13 05:55:02,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:55:02,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:02,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:02,106 INFO L85 PathProgramCache]: Analyzing trace with hash 144783149, now seen corresponding path program 1 times [2024-10-13 05:55:02,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:02,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444196606] [2024-10-13 05:55:02,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:02,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,406 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-13 05:55:02,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:02,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444196606] [2024-10-13 05:55:02,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444196606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:02,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:02,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:55:02,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081204366] [2024-10-13 05:55:02,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:55:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:02,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:55:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:55:02,413 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:55:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:02,475 INFO L93 Difference]: Finished difference Result 191 states and 286 transitions. [2024-10-13 05:55:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:55:02,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-13 05:55:02,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:02,480 INFO L225 Difference]: With dead ends: 191 [2024-10-13 05:55:02,480 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 05:55:02,481 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-13 05:55:02,482 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 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-13 05:55:02,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:55:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 05:55:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-13 05:55:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 83 states have internal predecessors, (120), 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-13 05:55:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-10-13 05:55:02,503 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 95 [2024-10-13 05:55:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:02,504 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-10-13 05:55:02,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:55:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-10-13 05:55:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 05:55:02,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:02,509 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] [2024-10-13 05:55:02,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:55:02,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:02,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1202621227, now seen corresponding path program 1 times [2024-10-13 05:55:02,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:02,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388438511] [2024-10-13 05:55:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:02,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,714 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-13 05:55:02,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:02,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388438511] [2024-10-13 05:55:02,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388438511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:02,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:02,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:55:02,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24133181] [2024-10-13 05:55:02,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:02,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:55:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:02,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:55:02,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:55:02,720 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-13 05:55:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:02,766 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2024-10-13 05:55:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:55:02,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 95 [2024-10-13 05:55:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:02,770 INFO L225 Difference]: With dead ends: 194 [2024-10-13 05:55:02,770 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 05:55:02,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:55:02,772 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:02,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:55:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 05:55:02,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-13 05:55:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 84 states have internal predecessors, (121), 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-13 05:55:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2024-10-13 05:55:02,784 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 95 [2024-10-13 05:55:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:02,785 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2024-10-13 05:55:02,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-13 05:55:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2024-10-13 05:55:02,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 05:55:02,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:02,787 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] [2024-10-13 05:55:02,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:55:02,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:02,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:02,790 INFO L85 PathProgramCache]: Analyzing trace with hash 615815213, now seen corresponding path program 1 times [2024-10-13 05:55:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:02,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186189692] [2024-10-13 05:55:02,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:02,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,163 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-13 05:55:03,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:03,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186189692] [2024-10-13 05:55:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186189692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:03,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:03,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:55:03,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452910034] [2024-10-13 05:55:03,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:03,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:55:03,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:03,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:55:03,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:55:03,169 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-13 05:55:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:03,210 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2024-10-13 05:55:03,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:55:03,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 95 [2024-10-13 05:55:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:03,213 INFO L225 Difference]: With dead ends: 197 [2024-10-13 05:55:03,213 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 05:55:03,214 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-13 05:55:03,214 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 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-13 05:55:03,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:55:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 05:55:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-13 05:55:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 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-13 05:55:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-10-13 05:55:03,233 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 95 [2024-10-13 05:55:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:03,236 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-10-13 05:55:03,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-13 05:55:03,236 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-10-13 05:55:03,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 05:55:03,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:03,238 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] [2024-10-13 05:55:03,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:55:03,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:03,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1033893213, now seen corresponding path program 1 times [2024-10-13 05:55:03,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:03,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436112168] [2024-10-13 05:55:03,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,413 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-13 05:55:03,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:03,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436112168] [2024-10-13 05:55:03,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436112168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:03,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:03,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:55:03,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372346997] [2024-10-13 05:55:03,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:03,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:55:03,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:03,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:55:03,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:55:03,418 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 05:55:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:03,458 INFO L93 Difference]: Finished difference Result 243 states and 359 transitions. [2024-10-13 05:55:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:55:03,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 98 [2024-10-13 05:55:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:03,460 INFO L225 Difference]: With dead ends: 243 [2024-10-13 05:55:03,460 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 05:55:03,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:55:03,463 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:03,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 271 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:55:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 05:55:03,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2024-10-13 05:55:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 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-13 05:55:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 175 transitions. [2024-10-13 05:55:03,481 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 175 transitions. Word has length 98 [2024-10-13 05:55:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:03,481 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 175 transitions. [2024-10-13 05:55:03,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 05:55:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 175 transitions. [2024-10-13 05:55:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 05:55:03,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:03,485 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] [2024-10-13 05:55:03,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:55:03,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:03,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1990890296, now seen corresponding path program 1 times [2024-10-13 05:55:03,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:03,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282805625] [2024-10-13 05:55:03,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:03,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,602 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-13 05:55:03,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:03,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282805625] [2024-10-13 05:55:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282805625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:03,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:03,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:55:03,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972759316] [2024-10-13 05:55:03,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:03,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:55:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:03,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:55:03,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:55:03,607 INFO L87 Difference]: Start difference. First operand 118 states and 175 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 05:55:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:03,632 INFO L93 Difference]: Finished difference Result 236 states and 351 transitions. [2024-10-13 05:55:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:55:03,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 98 [2024-10-13 05:55:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:03,635 INFO L225 Difference]: With dead ends: 236 [2024-10-13 05:55:03,635 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 05:55:03,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:55:03,636 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:03,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:55:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 05:55:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-13 05:55:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 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-13 05:55:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 176 transitions. [2024-10-13 05:55:03,648 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 176 transitions. Word has length 98 [2024-10-13 05:55:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:03,648 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 176 transitions. [2024-10-13 05:55:03,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 05:55:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2024-10-13 05:55:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 05:55:03,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:03,650 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] [2024-10-13 05:55:03,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:55:03,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:03,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:03,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1181543670, now seen corresponding path program 1 times [2024-10-13 05:55:03,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:03,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595555087] [2024-10-13 05:55:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:03,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:04,544 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-13 05:55:04,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:04,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595555087] [2024-10-13 05:55:04,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595555087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:04,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:04,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:55:04,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756410392] [2024-10-13 05:55:04,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:04,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:55:04,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:04,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:55:04,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:55:04,550 INFO L87 Difference]: Start difference. First operand 119 states and 176 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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-13 05:55:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:04,904 INFO L93 Difference]: Finished difference Result 322 states and 472 transitions. [2024-10-13 05:55:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:55:04,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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 98 [2024-10-13 05:55:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:04,907 INFO L225 Difference]: With dead ends: 322 [2024-10-13 05:55:04,908 INFO L226 Difference]: Without dead ends: 204 [2024-10-13 05:55:04,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:04,910 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 95 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:04,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 855 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:55:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-13 05:55:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2024-10-13 05:55:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 178 states have (on average 1.4269662921348314) internal successors, (254), 179 states have internal predecessors, (254), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:55:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 294 transitions. [2024-10-13 05:55:04,935 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 294 transitions. Word has length 98 [2024-10-13 05:55:04,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:04,935 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 294 transitions. [2024-10-13 05:55:04,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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-13 05:55:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 294 transitions. [2024-10-13 05:55:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 05:55:04,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:04,939 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-13 05:55:04,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:55:04,939 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:04,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash 886308523, now seen corresponding path program 1 times [2024-10-13 05:55:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:04,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574602147] [2024-10-13 05:55:04,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:04,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:55:05,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502229434] [2024-10-13 05:55:05,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:05,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:55:05,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:55:05,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:55:05,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 05:55:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:05,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 05:55:05,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:05,769 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-13 05:55:05,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:05,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:05,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574602147] [2024-10-13 05:55:05,772 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 05:55:05,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502229434] [2024-10-13 05:55:05,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502229434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:05,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:05,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:55:05,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017819074] [2024-10-13 05:55:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:05,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:55:05,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:05,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:55:05,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:55:05,778 INFO L87 Difference]: Start difference. First operand 201 states and 294 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 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-13 05:55:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:05,977 INFO L93 Difference]: Finished difference Result 542 states and 795 transitions. [2024-10-13 05:55:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:55:05,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 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-13 05:55:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:05,981 INFO L225 Difference]: With dead ends: 542 [2024-10-13 05:55:05,982 INFO L226 Difference]: Without dead ends: 342 [2024-10-13 05:55:05,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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-13 05:55:05,984 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 129 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:05,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 348 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:55:05,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-13 05:55:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 273. [2024-10-13 05:55:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 237 states have (on average 1.4135021097046414) internal successors, (335), 238 states have internal predecessors, (335), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 05:55:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 399 transitions. [2024-10-13 05:55:06,010 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 399 transitions. Word has length 100 [2024-10-13 05:55:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:06,011 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 399 transitions. [2024-10-13 05:55:06,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 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-13 05:55:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 399 transitions. [2024-10-13 05:55:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 05:55:06,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:06,014 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] [2024-10-13 05:55:06,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 05:55:06,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:55:06,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:06,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:06,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1046607687, now seen corresponding path program 1 times [2024-10-13 05:55:06,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:06,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909698712] [2024-10-13 05:55:06,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:06,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:06,546 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-13 05:55:06,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:06,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909698712] [2024-10-13 05:55:06,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909698712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:06,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:06,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:55:06,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312253799] [2024-10-13 05:55:06,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:06,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:55:06,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:06,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:55:06,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:55:06,549 INFO L87 Difference]: Start difference. First operand 273 states and 399 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-13 05:55:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:06,782 INFO L93 Difference]: Finished difference Result 614 states and 888 transitions. [2024-10-13 05:55:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:55:06,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 101 [2024-10-13 05:55:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:06,785 INFO L225 Difference]: With dead ends: 614 [2024-10-13 05:55:06,785 INFO L226 Difference]: Without dead ends: 414 [2024-10-13 05:55:06,786 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-13 05:55:06,787 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 84 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:06,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 509 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:55:06,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-13 05:55:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 410. [2024-10-13 05:55:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 360 states have (on average 1.3944444444444444) internal successors, (502), 363 states have internal predecessors, (502), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 05:55:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 590 transitions. [2024-10-13 05:55:06,812 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 590 transitions. Word has length 101 [2024-10-13 05:55:06,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:06,813 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 590 transitions. [2024-10-13 05:55:06,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-13 05:55:06,813 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 590 transitions. [2024-10-13 05:55:06,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 05:55:06,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:06,815 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] [2024-10-13 05:55:06,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:55:06,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:06,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1439634697, now seen corresponding path program 1 times [2024-10-13 05:55:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864830505] [2024-10-13 05:55:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,611 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-13 05:55:07,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:07,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864830505] [2024-10-13 05:55:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864830505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:07,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:07,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:55:07,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351299416] [2024-10-13 05:55:07,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:07,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:55:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:07,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:55:07,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:55:07,614 INFO L87 Difference]: Start difference. First operand 410 states and 590 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 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-13 05:55:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:08,209 INFO L93 Difference]: Finished difference Result 1080 states and 1552 transitions. [2024-10-13 05:55:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:55:08,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 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 101 [2024-10-13 05:55:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:08,214 INFO L225 Difference]: With dead ends: 1080 [2024-10-13 05:55:08,215 INFO L226 Difference]: Without dead ends: 747 [2024-10-13 05:55:08,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:55:08,216 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 116 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:08,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1004 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:55:08,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-10-13 05:55:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2024-10-13 05:55:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 652 states have (on average 1.3957055214723926) internal successors, (910), 659 states have internal predecessors, (910), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-13 05:55:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1058 transitions. [2024-10-13 05:55:08,256 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1058 transitions. Word has length 101 [2024-10-13 05:55:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:08,256 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1058 transitions. [2024-10-13 05:55:08,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 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-13 05:55:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1058 transitions. [2024-10-13 05:55:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 05:55:08,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:08,258 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-13 05:55:08,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 05:55:08,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:08,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:08,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1032389315, now seen corresponding path program 1 times [2024-10-13 05:55:08,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:08,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779421816] [2024-10-13 05:55:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:09,565 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-13 05:55:09,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:09,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779421816] [2024-10-13 05:55:09,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779421816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:09,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:09,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 05:55:09,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977613245] [2024-10-13 05:55:09,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:09,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:55:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:09,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:55:09,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:55:09,568 INFO L87 Difference]: Start difference. First operand 736 states and 1058 transitions. Second operand has 10 states, 7 states have (on average 6.571428571428571) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 05:55:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:10,049 INFO L93 Difference]: Finished difference Result 1383 states and 1976 transitions. [2024-10-13 05:55:10,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:55:10,050 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 6.571428571428571) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2024-10-13 05:55:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:10,056 INFO L225 Difference]: With dead ends: 1383 [2024-10-13 05:55:10,056 INFO L226 Difference]: Without dead ends: 754 [2024-10-13 05:55:10,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:55:10,058 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 146 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:10,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 861 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:55:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-13 05:55:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2024-10-13 05:55:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 664 states have (on average 1.3825301204819278) internal successors, (918), 671 states have internal predecessors, (918), 74 states have call successors, (74), 13 states have call predecessors, (74), 13 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-13 05:55:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1066 transitions. [2024-10-13 05:55:10,109 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1066 transitions. Word has length 103 [2024-10-13 05:55:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:10,109 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1066 transitions. [2024-10-13 05:55:10,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 6.571428571428571) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 05:55:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1066 transitions. [2024-10-13 05:55:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 05:55:10,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:10,111 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-13 05:55:10,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 05:55:10,112 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:10,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1425416325, now seen corresponding path program 1 times [2024-10-13 05:55:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:10,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943876988] [2024-10-13 05:55:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:10,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:11,327 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-13 05:55:11,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:11,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943876988] [2024-10-13 05:55:11,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943876988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:11,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:11,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 05:55:11,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429080918] [2024-10-13 05:55:11,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:11,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 05:55:11,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:11,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 05:55:11,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:11,330 INFO L87 Difference]: Start difference. First operand 752 states and 1066 transitions. Second operand has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 11 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-13 05:55:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:12,180 INFO L93 Difference]: Finished difference Result 1699 states and 2404 transitions. [2024-10-13 05:55:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:55:12,181 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 11 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-13 05:55:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:12,186 INFO L225 Difference]: With dead ends: 1699 [2024-10-13 05:55:12,187 INFO L226 Difference]: Without dead ends: 1054 [2024-10-13 05:55:12,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:55:12,189 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 172 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:12,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1060 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:55:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-10-13 05:55:12,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 941. [2024-10-13 05:55:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 842 states have (on average 1.3919239904988123) internal successors, (1172), 851 states have internal predecessors, (1172), 82 states have call successors, (82), 16 states have call predecessors, (82), 16 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 05:55:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1336 transitions. [2024-10-13 05:55:12,261 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1336 transitions. Word has length 103 [2024-10-13 05:55:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:12,261 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1336 transitions. [2024-10-13 05:55:12,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 11 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-13 05:55:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1336 transitions. [2024-10-13 05:55:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 05:55:12,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:12,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, 1] [2024-10-13 05:55:12,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 05:55:12,264 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:12,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 604423933, now seen corresponding path program 1 times [2024-10-13 05:55:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483702041] [2024-10-13 05:55:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:12,590 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-13 05:55:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:12,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483702041] [2024-10-13 05:55:12,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483702041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:12,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:12,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:55:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880145936] [2024-10-13 05:55:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:12,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:55:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:12,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:55:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:55:12,593 INFO L87 Difference]: Start difference. First operand 941 states and 1336 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-13 05:55:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:12,969 INFO L93 Difference]: Finished difference Result 2184 states and 3097 transitions. [2024-10-13 05:55:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:55:12,970 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-13 05:55:12,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:12,977 INFO L225 Difference]: With dead ends: 2184 [2024-10-13 05:55:12,977 INFO L226 Difference]: Without dead ends: 1354 [2024-10-13 05:55:12,981 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-13 05:55:12,981 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 106 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:12,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 481 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:55:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-10-13 05:55:13,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1114. [2024-10-13 05:55:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1005 states have (on average 1.4) internal successors, (1407), 1016 states have internal predecessors, (1407), 90 states have call successors, (90), 18 states have call predecessors, (90), 18 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-13 05:55:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1587 transitions. [2024-10-13 05:55:13,058 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1587 transitions. Word has length 103 [2024-10-13 05:55:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:13,059 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1587 transitions. [2024-10-13 05:55:13,059 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-13 05:55:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1587 transitions. [2024-10-13 05:55:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 05:55:13,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:13,061 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-13 05:55:13,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 05:55:13,061 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:13,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash -213224517, now seen corresponding path program 1 times [2024-10-13 05:55:13,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:13,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140481981] [2024-10-13 05:55:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:13,932 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-13 05:55:13,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:13,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140481981] [2024-10-13 05:55:13,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140481981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:13,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:13,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:55:13,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100294931] [2024-10-13 05:55:13,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:13,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:55:13,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:13,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:55:13,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:55:13,934 INFO L87 Difference]: Start difference. First operand 1114 states and 1587 transitions. Second operand has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 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-13 05:55:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:14,601 INFO L93 Difference]: Finished difference Result 2191 states and 3114 transitions. [2024-10-13 05:55:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:55:14,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 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-13 05:55:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:14,607 INFO L225 Difference]: With dead ends: 2191 [2024-10-13 05:55:14,608 INFO L226 Difference]: Without dead ends: 1247 [2024-10-13 05:55:14,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:14,612 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 98 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:14,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1270 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:55:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2024-10-13 05:55:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1128. [2024-10-13 05:55:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1019 states have (on average 1.3964671246319922) internal successors, (1423), 1030 states have internal predecessors, (1423), 90 states have call successors, (90), 18 states have call predecessors, (90), 18 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-13 05:55:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1603 transitions. [2024-10-13 05:55:14,681 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1603 transitions. Word has length 103 [2024-10-13 05:55:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:14,683 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1603 transitions. [2024-10-13 05:55:14,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 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-13 05:55:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1603 transitions. [2024-10-13 05:55:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 05:55:14,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:14,686 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-13 05:55:14,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 05:55:14,686 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:14,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:14,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1644271043, now seen corresponding path program 1 times [2024-10-13 05:55:14,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250069286] [2024-10-13 05:55:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:15,662 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-13 05:55:15,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:15,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250069286] [2024-10-13 05:55:15,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250069286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:15,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:15,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:55:15,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829849931] [2024-10-13 05:55:15,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:15,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:55:15,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:15,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:55:15,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:55:15,666 INFO L87 Difference]: Start difference. First operand 1128 states and 1603 transitions. Second operand has 9 states, 6 states have (on average 7.666666666666667) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 05:55:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:16,268 INFO L93 Difference]: Finished difference Result 2088 states and 2960 transitions. [2024-10-13 05:55:16,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:55:16,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 7.666666666666667) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2024-10-13 05:55:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:16,275 INFO L225 Difference]: With dead ends: 2088 [2024-10-13 05:55:16,275 INFO L226 Difference]: Without dead ends: 1130 [2024-10-13 05:55:16,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:16,279 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 103 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:16,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1031 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:55:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-10-13 05:55:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1126. [2024-10-13 05:55:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1010 states have (on average 1.39009900990099) internal successors, (1404), 1021 states have internal predecessors, (1404), 94 states have call successors, (94), 21 states have call predecessors, (94), 21 states have return successors, (94), 83 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-13 05:55:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1592 transitions. [2024-10-13 05:55:16,360 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1592 transitions. Word has length 103 [2024-10-13 05:55:16,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:16,361 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1592 transitions. [2024-10-13 05:55:16,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 7.666666666666667) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 05:55:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1592 transitions. [2024-10-13 05:55:16,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 05:55:16,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:16,363 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-13 05:55:16,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 05:55:16,363 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:16,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:16,364 INFO L85 PathProgramCache]: Analyzing trace with hash 385569215, now seen corresponding path program 1 times [2024-10-13 05:55:16,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:16,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956854747] [2024-10-13 05:55:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:16,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:17,272 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-13 05:55:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:17,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956854747] [2024-10-13 05:55:17,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956854747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:17,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:17,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:55:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083239788] [2024-10-13 05:55:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:17,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:55:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:55:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:55:17,275 INFO L87 Difference]: Start difference. First operand 1126 states and 1592 transitions. Second operand has 9 states, 6 states have (on average 7.666666666666667) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 05:55:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:17,875 INFO L93 Difference]: Finished difference Result 2203 states and 3103 transitions. [2024-10-13 05:55:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:55:17,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 7.666666666666667) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2024-10-13 05:55:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:17,882 INFO L225 Difference]: With dead ends: 2203 [2024-10-13 05:55:17,882 INFO L226 Difference]: Without dead ends: 1247 [2024-10-13 05:55:17,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:17,884 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 202 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:17,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 919 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:55:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2024-10-13 05:55:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 993. [2024-10-13 05:55:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 891 states have (on average 1.3905723905723906) internal successors, (1239), 900 states have internal predecessors, (1239), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 05:55:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1403 transitions. [2024-10-13 05:55:17,953 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1403 transitions. Word has length 103 [2024-10-13 05:55:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:17,953 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1403 transitions. [2024-10-13 05:55:17,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 7.666666666666667) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 05:55:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1403 transitions. [2024-10-13 05:55:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 05:55:17,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:17,956 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-13 05:55:17,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 05:55:17,956 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:17,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash -330589044, now seen corresponding path program 1 times [2024-10-13 05:55:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:17,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590041607] [2024-10-13 05:55:17,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:17,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,595 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-13 05:55:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590041607] [2024-10-13 05:55:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590041607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:18,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:18,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:55:18,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5225581] [2024-10-13 05:55:18,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:18,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:55:18,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:18,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:55:18,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:55:18,597 INFO L87 Difference]: Start difference. First operand 993 states and 1403 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 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-13 05:55:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:19,352 INFO L93 Difference]: Finished difference Result 2165 states and 3045 transitions. [2024-10-13 05:55:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:55:19,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 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-13 05:55:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:19,359 INFO L225 Difference]: With dead ends: 2165 [2024-10-13 05:55:19,359 INFO L226 Difference]: Without dead ends: 1342 [2024-10-13 05:55:19,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:19,362 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 205 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:19,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 896 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:55:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2024-10-13 05:55:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1126. [2024-10-13 05:55:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1012 states have (on average 1.384387351778656) internal successors, (1401), 1023 states have internal predecessors, (1401), 92 states have call successors, (92), 21 states have call predecessors, (92), 21 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 05:55:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1585 transitions. [2024-10-13 05:55:19,458 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1585 transitions. Word has length 104 [2024-10-13 05:55:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:19,458 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1585 transitions. [2024-10-13 05:55:19,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 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-13 05:55:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1585 transitions. [2024-10-13 05:55:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 05:55:19,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:19,460 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-13 05:55:19,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 05:55:19,461 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:19,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:19,461 INFO L85 PathProgramCache]: Analyzing trace with hash -72423606, now seen corresponding path program 1 times [2024-10-13 05:55:19,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:19,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257638356] [2024-10-13 05:55:19,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:19,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:20,163 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-13 05:55:20,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:20,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257638356] [2024-10-13 05:55:20,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257638356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:20,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:20,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:55:20,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282632407] [2024-10-13 05:55:20,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:20,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:55:20,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:20,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:55:20,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:55:20,166 INFO L87 Difference]: Start difference. First operand 1126 states and 1585 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 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-13 05:55:20,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:20,878 INFO L93 Difference]: Finished difference Result 2219 states and 3118 transitions. [2024-10-13 05:55:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:55:20,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 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-13 05:55:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:20,885 INFO L225 Difference]: With dead ends: 2219 [2024-10-13 05:55:20,885 INFO L226 Difference]: Without dead ends: 1269 [2024-10-13 05:55:20,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:20,888 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 201 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:20,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 896 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:55:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-10-13 05:55:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1129. [2024-10-13 05:55:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1015 states have (on average 1.3842364532019704) internal successors, (1405), 1026 states have internal predecessors, (1405), 92 states have call successors, (92), 21 states have call predecessors, (92), 21 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 05:55:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1589 transitions. [2024-10-13 05:55:20,967 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1589 transitions. Word has length 104 [2024-10-13 05:55:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:20,968 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1589 transitions. [2024-10-13 05:55:20,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 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-13 05:55:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1589 transitions. [2024-10-13 05:55:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 05:55:20,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:20,970 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-13 05:55:20,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 05:55:20,970 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:20,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:20,970 INFO L85 PathProgramCache]: Analyzing trace with hash -465450616, now seen corresponding path program 1 times [2024-10-13 05:55:20,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:20,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933992690] [2024-10-13 05:55:20,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:20,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:21,744 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-13 05:55:21,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:21,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933992690] [2024-10-13 05:55:21,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933992690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:21,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:21,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:55:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675443868] [2024-10-13 05:55:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:21,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:55:21,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:21,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:55:21,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:55:21,746 INFO L87 Difference]: Start difference. First operand 1129 states and 1589 transitions. Second operand has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 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-13 05:55:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:22,219 INFO L93 Difference]: Finished difference Result 2199 states and 3097 transitions. [2024-10-13 05:55:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:55:22,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 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 104 [2024-10-13 05:55:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:22,225 INFO L225 Difference]: With dead ends: 2199 [2024-10-13 05:55:22,225 INFO L226 Difference]: Without dead ends: 1246 [2024-10-13 05:55:22,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:22,228 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 97 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:22,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 753 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:55:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2024-10-13 05:55:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1131. [2024-10-13 05:55:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1017 states have (on average 1.3834808259587021) internal successors, (1407), 1028 states have internal predecessors, (1407), 92 states have call successors, (92), 21 states have call predecessors, (92), 21 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 05:55:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1591 transitions. [2024-10-13 05:55:22,331 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1591 transitions. Word has length 104 [2024-10-13 05:55:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:22,332 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1591 transitions. [2024-10-13 05:55:22,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 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-13 05:55:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1591 transitions. [2024-10-13 05:55:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 05:55:22,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:22,334 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-13 05:55:22,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 05:55:22,334 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:22,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:22,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1339987718, now seen corresponding path program 1 times [2024-10-13 05:55:22,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:22,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722123662] [2024-10-13 05:55:22,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:22,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:23,204 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-13 05:55:23,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:23,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722123662] [2024-10-13 05:55:23,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722123662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:23,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:23,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 05:55:23,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784393958] [2024-10-13 05:55:23,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:23,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:55:23,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:23,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:55:23,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:55:23,207 INFO L87 Difference]: Start difference. First operand 1131 states and 1591 transitions. Second operand has 10 states, 7 states have (on average 6.714285714285714) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 05:55:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:24,314 INFO L93 Difference]: Finished difference Result 2333 states and 3270 transitions. [2024-10-13 05:55:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:55:24,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 6.714285714285714) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 104 [2024-10-13 05:55:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:24,322 INFO L225 Difference]: With dead ends: 2333 [2024-10-13 05:55:24,322 INFO L226 Difference]: Without dead ends: 1374 [2024-10-13 05:55:24,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:55:24,327 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 242 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:24,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1325 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 05:55:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2024-10-13 05:55:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1118. [2024-10-13 05:55:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1004 states have (on average 1.3804780876494025) internal successors, (1386), 1015 states have internal predecessors, (1386), 92 states have call successors, (92), 21 states have call predecessors, (92), 21 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 05:55:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1570 transitions. [2024-10-13 05:55:24,419 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1570 transitions. Word has length 104 [2024-10-13 05:55:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:24,420 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1570 transitions. [2024-10-13 05:55:24,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 6.714285714285714) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 05:55:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1570 transitions. [2024-10-13 05:55:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 05:55:24,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:24,422 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-13 05:55:24,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 05:55:24,422 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:24,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:24,423 INFO L85 PathProgramCache]: Analyzing trace with hash 333727551, now seen corresponding path program 1 times [2024-10-13 05:55:24,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:24,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170722810] [2024-10-13 05:55:24,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:24,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:55:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:55:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:55:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:55:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:55:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:55:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:55:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:55:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:55:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:55:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:55:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:55:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:25,806 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-13 05:55:25,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:55:25,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170722810] [2024-10-13 05:55:25,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170722810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:25,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:25,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 05:55:25,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745856444] [2024-10-13 05:55:25,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:25,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:55:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:55:25,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:55:25,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:55:25,811 INFO L87 Difference]: Start difference. First operand 1118 states and 1570 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 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-13 05:55:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:26,681 INFO L93 Difference]: Finished difference Result 2266 states and 3180 transitions. [2024-10-13 05:55:26,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 05:55:26,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 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 105 [2024-10-13 05:55:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:26,693 INFO L225 Difference]: With dead ends: 2266 [2024-10-13 05:55:26,693 INFO L226 Difference]: Without dead ends: 1320 [2024-10-13 05:55:26,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-13 05:55:26,697 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 107 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:26,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1975 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:55:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2024-10-13 05:55:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1184. [2024-10-13 05:55:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1070 states have (on average 1.3822429906542055) internal successors, (1479), 1081 states have internal predecessors, (1479), 92 states have call successors, (92), 21 states have call predecessors, (92), 21 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 05:55:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1663 transitions. [2024-10-13 05:55:26,782 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1663 transitions. Word has length 105 [2024-10-13 05:55:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:26,783 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1663 transitions. [2024-10-13 05:55:26,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 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-13 05:55:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1663 transitions. [2024-10-13 05:55:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 05:55:26,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:26,786 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, 1] [2024-10-13 05:55:26,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 05:55:26,786 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:26,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:26,787 INFO L85 PathProgramCache]: Analyzing trace with hash 49142305, now seen corresponding path program 1 times [2024-10-13 05:55:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:55:26,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42288693] [2024-10-13 05:55:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:26,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:55:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:55:26,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077908534] [2024-10-13 05:55:26,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:26,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:55:26,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:55:26,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:55:26,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 05:55:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:55:27,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:55:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:55:27,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:55:27,316 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:55:27,317 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:55:27,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 05:55:27,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 05:55:27,523 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:55:27,590 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:55:27,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:55:27 BoogieIcfgContainer [2024-10-13 05:55:27,593 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:55:27,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:55:27,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:55:27,593 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:55:27,594 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:55:01" (3/4) ... [2024-10-13 05:55:27,599 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:55:27,600 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:55:27,601 INFO L158 Benchmark]: Toolchain (without parser) took 27644.02ms. Allocated memory was 174.1MB in the beginning and 752.9MB in the end (delta: 578.8MB). Free memory was 118.1MB in the beginning and 407.4MB in the end (delta: -289.3MB). Peak memory consumption was 290.9MB. Max. memory is 16.1GB. [2024-10-13 05:55:27,601 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 174.1MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:55:27,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.51ms. Allocated memory is still 174.1MB. Free memory was 117.7MB in the beginning and 100.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 05:55:27,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.58ms. Allocated memory is still 174.1MB. Free memory was 100.6MB in the beginning and 96.0MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 05:55:27,602 INFO L158 Benchmark]: Boogie Preprocessor took 83.63ms. Allocated memory is still 174.1MB. Free memory was 96.0MB in the beginning and 90.4MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:55:27,602 INFO L158 Benchmark]: RCFGBuilder took 982.56ms. Allocated memory was 174.1MB in the beginning and 247.5MB in the end (delta: 73.4MB). Free memory was 90.4MB in the beginning and 193.3MB in the end (delta: -102.9MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2024-10-13 05:55:27,603 INFO L158 Benchmark]: TraceAbstraction took 26138.20ms. Allocated memory was 247.5MB in the beginning and 752.9MB in the end (delta: 505.4MB). Free memory was 192.3MB in the beginning and 408.4MB in the end (delta: -216.2MB). Peak memory consumption was 290.3MB. Max. memory is 16.1GB. [2024-10-13 05:55:27,603 INFO L158 Benchmark]: Witness Printer took 7.34ms. Allocated memory is still 752.9MB. Free memory was 408.4MB in the beginning and 407.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:55:27,607 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 174.1MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.51ms. Allocated memory is still 174.1MB. Free memory was 117.7MB in the beginning and 100.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.58ms. Allocated memory is still 174.1MB. Free memory was 100.6MB in the beginning and 96.0MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.63ms. Allocated memory is still 174.1MB. Free memory was 96.0MB in the beginning and 90.4MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 982.56ms. Allocated memory was 174.1MB in the beginning and 247.5MB in the end (delta: 73.4MB). Free memory was 90.4MB in the beginning and 193.3MB in the end (delta: -102.9MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26138.20ms. Allocated memory was 247.5MB in the beginning and 752.9MB in the end (delta: 505.4MB). Free memory was 192.3MB in the beginning and 408.4MB in the end (delta: -216.2MB). Peak memory consumption was 290.3MB. Max. memory is 16.1GB. * Witness Printer took 7.34ms. Allocated memory is still 752.9MB. Free memory was 408.4MB in the beginning and 407.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someUnaryDOUBLEoperation at line 26. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L31] unsigned short int last_1_unsigned_short_int_Array_0_0__0_ = 8; [L32] unsigned short int last_1_unsigned_short_int_Array_0_1__2_ = 10; [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] CALL updateLastVariables() [L84] EXPR unsigned_short_int_Array_0[0][0] [L84] last_1_unsigned_short_int_Array_0_0__0_ = unsigned_short_int_Array_0[0][0] [L85] EXPR unsigned_short_int_Array_0[1][2] [L85] last_1_unsigned_short_int_Array_0_1__2_ = unsigned_short_int_Array_0[1][2] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L63] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L64] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L65] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L66] float_Array_0[0] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[0] [L67] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L67] EXPR float_Array_0[0] [L67] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L68] float_Array_0[1] = __VERIFIER_nondet_float() [L69] EXPR float_Array_0[1] [L69] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L69] EXPR float_Array_0[1] [L69] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L70] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L71] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L71] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L71] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L72] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L72] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L72] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L73] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L74] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L74] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L74] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L75] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L75] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L75] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L76] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L77] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L77] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L77] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L78] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L78] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L79] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L80] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L81] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L81] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L96] RET updateVariables() [L97] CALL step() [L36] COND TRUE last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_) [L37] EXPR unsigned_short_int_Array_0[0][2] [L37] EXPR unsigned_short_int_Array_0[1][1] [L37] EXPR unsigned_short_int_Array_0[0][1] [L37] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L37] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) [L37] EXPR unsigned_short_int_Array_0[1][0] [L37] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L37] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) [L37] EXPR unsigned_short_int_Array_0[0][2] [L37] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L37] unsigned_short_int_Array_0[1][2] = ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))) [L39] EXPR BOOL_unsigned_char_Array_0[0] [L39] BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L39] BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) [L39] EXPR unsigned_short_int_Array_0[1][1] [L39] EXPR unsigned_short_int_Array_0[1][0] [L39] BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L39] COND FALSE !(BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) [L50] EXPR unsigned_short_int_Array_0[1][1] [L50] unsigned_short_int_Array_0[0][0] = unsigned_short_int_Array_0[1][1] [L52] EXPR unsigned_short_int_Array_0[0][1] [L52] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L52] COND FALSE !(unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) [L59] EXPR float_Array_0[0] [L59] float_Array_0[2] = float_Array_0[0] [L97] RET step() [L98] CALL, EXPR property() [L88] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1 [L88] EXPR unsigned_short_int_Array_0[1][2] [L88] EXPR unsigned_short_int_Array_0[0][2] [L88] EXPR unsigned_short_int_Array_0[1][1] [L88] EXPR unsigned_short_int_Array_0[0][1] [L88] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) [L88] EXPR unsigned_short_int_Array_0[1][0] [L88] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) [L88] EXPR unsigned_short_int_Array_0[0][2] [L88] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1]))) [L88] EXPR BOOL_unsigned_char_Array_0[0] [L88] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) [L88] EXPR unsigned_short_int_Array_0[1][1] [L88] EXPR unsigned_short_int_Array_0[1][0] [L88] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])) [L88] EXPR unsigned_short_int_Array_0[0][0] [L88] EXPR unsigned_short_int_Array_0[1][1] [L88] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) [L88] EXPR unsigned_short_int_Array_0[0][1] [L88] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0])) [L88] EXPR float_Array_0[2] [L88] EXPR float_Array_0[0] [L88] EXPR (unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88-L89] return (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.0s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2185 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2162 mSDsluCounter, 15932 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12699 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7229 IncrementalHoareTripleChecker+Invalid, 7404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 3233 mSDtfsCounter, 7229 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 858 GetRequests, 714 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1184occurred in iteration=21, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 1708 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 2427 NumberOfCodeBlocks, 2427 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2094 ConstructedInterpolants, 0 QuantifiedInterpolants, 6299 SizeOfPredicates, 3 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 5544/5544 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-13 05:55:27,677 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-2.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 6c2afc665f9ec9bbf6f489827c9a63486fda067f850cc8b511cbd83d8b773bd8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:55:29,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:55:30,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:55:30,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:55:30,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:55:30,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:55:30,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:55:30,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:55:30,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:55:30,073 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:55:30,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:55:30,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:55:30,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:55:30,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:55:30,077 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:55:30,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:55:30,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:55:30,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:55:30,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:55:30,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:55:30,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:55:30,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:55:30,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:55:30,083 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:55:30,083 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:55:30,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:55:30,084 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:55:30,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:55:30,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:55:30,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:55:30,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:55:30,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:55:30,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:55:30,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:55:30,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:55:30,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:55:30,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:55:30,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:55:30,087 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:55:30,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:55:30,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:55:30,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:55:30,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:55:30,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:55:30,089 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:55:30,090 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 -> 6c2afc665f9ec9bbf6f489827c9a63486fda067f850cc8b511cbd83d8b773bd8 [2024-10-13 05:55:30,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:55:30,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:55:30,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:55:30,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:55:30,468 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:55:30,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.i [2024-10-13 05:55:32,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:55:32,334 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:55:32,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.i [2024-10-13 05:55:32,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/213b95323/7f189e2e5d5d4da6a06de2edea16b17e/FLAGba3400690 [2024-10-13 05:55:32,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/213b95323/7f189e2e5d5d4da6a06de2edea16b17e [2024-10-13 05:55:32,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:55:32,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:55:32,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:55:32,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:55:32,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:55:32,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:32,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50532a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32, skipping insertion in model container [2024-10-13 05:55:32,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:32,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:55:32,616 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-2.i[915,928] [2024-10-13 05:55:32,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:55:32,734 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:55:32,753 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-2.i[915,928] [2024-10-13 05:55:32,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:55:32,847 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:55:32,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32 WrapperNode [2024-10-13 05:55:32,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:55:32,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:55:32,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:55:32,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:55:32,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:32,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:32,925 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-10-13 05:55:32,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:55:32,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:55:32,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:55:32,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:55:32,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:32,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:32,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:32,987 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2024-10-13 05:55:32,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:32,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:33,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:33,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:33,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:33,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:33,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:55:33,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:55:33,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:55:33,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:55:33,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (1/1) ... [2024-10-13 05:55:33,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:55:33,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:55:33,097 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-13 05:55:33,100 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-13 05:55:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:55:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 05:55:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 05:55:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 05:55:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 05:55:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 05:55:33,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 05:55:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-13 05:55:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-13 05:55:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:55:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 05:55:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 05:55:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 05:55:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 05:55:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 05:55:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-13 05:55:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-13 05:55:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 05:55:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 05:55:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-13 05:55:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-13 05:55:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 05:55:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 05:55:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-13 05:55:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-13 05:55:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 05:55:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 05:55:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-13 05:55:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-13 05:55:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:55:33,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:55:33,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:55:33,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:55:33,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 05:55:33,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 05:55:33,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 05:55:33,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 05:55:33,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 05:55:33,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 05:55:33,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-13 05:55:33,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-13 05:55:33,325 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:55:33,327 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:55:34,140 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-10-13 05:55:34,141 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:55:34,191 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:55:34,192 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:55:34,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:55:34 BoogieIcfgContainer [2024-10-13 05:55:34,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:55:34,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:55:34,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:55:34,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:55:34,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:55:32" (1/3) ... [2024-10-13 05:55:34,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f0820b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:55:34, skipping insertion in model container [2024-10-13 05:55:34,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:32" (2/3) ... [2024-10-13 05:55:34,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f0820b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:55:34, skipping insertion in model container [2024-10-13 05:55:34,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:55:34" (3/3) ... [2024-10-13 05:55:34,204 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-2.i [2024-10-13 05:55:34,224 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:55:34,224 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:55:34,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:55:34,310 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;@76b5463e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:55:34,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:55:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 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-13 05:55:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 05:55:34,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:34,331 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] [2024-10-13 05:55:34,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:34,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash -447108497, now seen corresponding path program 1 times [2024-10-13 05:55:34,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:34,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064441587] [2024-10-13 05:55:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:34,357 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-13 05:55:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:34,360 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-13 05:55:34,362 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-13 05:55:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:34,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:55:34,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-13 05:55:34,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:34,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:34,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064441587] [2024-10-13 05:55:34,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064441587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:34,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:34,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:55:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822538709] [2024-10-13 05:55:34,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:34,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:55:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:34,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:55:34,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:55:34,783 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 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.0) internal successors, (42), 2 states have internal predecessors, (42), 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-13 05:55:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:34,839 INFO L93 Difference]: Finished difference Result 183 states and 292 transitions. [2024-10-13 05:55:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:55:34,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 95 [2024-10-13 05:55:34,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:34,855 INFO L225 Difference]: With dead ends: 183 [2024-10-13 05:55:34,856 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 05:55:34,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 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-13 05:55:34,865 INFO L432 NwaCegarLoop]: 132 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, 132 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-13 05:55:34,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:55:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 05:55:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 05:55:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 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-13 05:55:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2024-10-13 05:55:34,920 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 95 [2024-10-13 05:55:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:34,920 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2024-10-13 05:55:34,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-13 05:55:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2024-10-13 05:55:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 05:55:34,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:34,929 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] [2024-10-13 05:55:34,939 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-13 05:55:35,133 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-13 05:55:35,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:35,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:35,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1556513981, now seen corresponding path program 1 times [2024-10-13 05:55:35,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:35,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241266635] [2024-10-13 05:55:35,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:35,136 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-13 05:55:35,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:35,138 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-13 05:55:35,139 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-13 05:55:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:35,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 05:55:35,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:35,478 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-13 05:55:35,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:35,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:35,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241266635] [2024-10-13 05:55:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241266635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:35,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:35,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:55:35,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045752205] [2024-10-13 05:55:35,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:35,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:55:35,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:35,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:55:35,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:55:35,484 INFO L87 Difference]: Start difference. First operand 91 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (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-13 05:55:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:35,551 INFO L93 Difference]: Finished difference Result 183 states and 274 transitions. [2024-10-13 05:55:35,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:55:35,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (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 95 [2024-10-13 05:55:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:35,554 INFO L225 Difference]: With dead ends: 183 [2024-10-13 05:55:35,554 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 05:55:35,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 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-13 05:55:35,556 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 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-13 05:55:35,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:55:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 05:55:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 05:55:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 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-13 05:55:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 138 transitions. [2024-10-13 05:55:35,571 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 138 transitions. Word has length 95 [2024-10-13 05:55:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:35,573 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 138 transitions. [2024-10-13 05:55:35,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (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-13 05:55:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 138 transitions. [2024-10-13 05:55:35,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 05:55:35,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:35,576 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] [2024-10-13 05:55:35,588 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-13 05:55:35,776 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-13 05:55:35,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:35,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash -498675903, now seen corresponding path program 1 times [2024-10-13 05:55:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:35,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372826037] [2024-10-13 05:55:35,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:35,779 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-13 05:55:35,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:35,783 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-13 05:55:35,788 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-13 05:55:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:35,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 05:55:36,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:36,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:36,103 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 37 treesize of output 17 [2024-10-13 05:55:36,687 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-13 05:55:36,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:36,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372826037] [2024-10-13 05:55:36,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372826037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:36,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:36,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:55:36,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883725133] [2024-10-13 05:55:36,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:36,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:55:36,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:55:36,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:55:36,690 INFO L87 Difference]: Start difference. First operand 93 states and 138 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-13 05:55:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:37,096 INFO L93 Difference]: Finished difference Result 278 states and 413 transitions. [2024-10-13 05:55:37,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:55:37,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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 95 [2024-10-13 05:55:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:37,099 INFO L225 Difference]: With dead ends: 278 [2024-10-13 05:55:37,099 INFO L226 Difference]: Without dead ends: 186 [2024-10-13 05:55:37,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 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-13 05:55:37,101 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 117 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:37,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 330 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:55:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-13 05:55:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 155. [2024-10-13 05:55:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 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-13 05:55:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2024-10-13 05:55:37,129 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 95 [2024-10-13 05:55:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:37,130 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2024-10-13 05:55:37,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-13 05:55:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2024-10-13 05:55:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 05:55:37,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:37,132 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] [2024-10-13 05:55:37,140 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-13 05:55:37,332 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-13 05:55:37,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:37,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:37,334 INFO L85 PathProgramCache]: Analyzing trace with hash -285628438, now seen corresponding path program 1 times [2024-10-13 05:55:37,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:37,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180825983] [2024-10-13 05:55:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:37,335 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-13 05:55:37,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:37,336 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-13 05:55:37,338 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-13 05:55:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:37,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 05:55:37,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:37,553 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-13 05:55:37,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:37,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:37,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180825983] [2024-10-13 05:55:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180825983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:37,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:37,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:55:37,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456615680] [2024-10-13 05:55:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:37,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:55:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:37,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:55:37,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:55:37,556 INFO L87 Difference]: Start difference. First operand 155 states and 229 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-13 05:55:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:37,588 INFO L93 Difference]: Finished difference Result 256 states and 380 transitions. [2024-10-13 05:55:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:55:37,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 101 [2024-10-13 05:55:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:37,591 INFO L225 Difference]: With dead ends: 256 [2024-10-13 05:55:37,591 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 05:55:37,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:55:37,593 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:37,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:55:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 05:55:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-13 05:55:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.4076923076923078) internal successors, (183), 130 states have internal predecessors, (183), 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-13 05:55:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 231 transitions. [2024-10-13 05:55:37,622 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 231 transitions. Word has length 101 [2024-10-13 05:55:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:37,622 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 231 transitions. [2024-10-13 05:55:37,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-13 05:55:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 231 transitions. [2024-10-13 05:55:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 05:55:37,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:37,624 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] [2024-10-13 05:55:37,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 05:55:37,825 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-13 05:55:37,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:37,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:37,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1306696792, now seen corresponding path program 1 times [2024-10-13 05:55:37,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:37,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276739896] [2024-10-13 05:55:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:37,833 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-13 05:55:37,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:37,835 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-13 05:55:37,837 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-13 05:55:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:38,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 05:55:38,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:38,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:38,097 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 40 treesize of output 16 [2024-10-13 05:55:38,150 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-13 05:55:38,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:38,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:38,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276739896] [2024-10-13 05:55:38,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276739896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:38,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:38,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:55:38,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447165716] [2024-10-13 05:55:38,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:38,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:55:38,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:38,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:55:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:55:38,153 INFO L87 Difference]: Start difference. First operand 157 states and 231 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-13 05:55:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:38,643 INFO L93 Difference]: Finished difference Result 313 states and 458 transitions. [2024-10-13 05:55:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:55:38,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 101 [2024-10-13 05:55:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:38,646 INFO L225 Difference]: With dead ends: 313 [2024-10-13 05:55:38,646 INFO L226 Difference]: Without dead ends: 220 [2024-10-13 05:55:38,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 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-13 05:55:38,648 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 81 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:38,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 485 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:55:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-13 05:55:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2024-10-13 05:55:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 183 states have (on average 1.4043715846994536) internal successors, (257), 184 states have internal predecessors, (257), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 05:55:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 317 transitions. [2024-10-13 05:55:38,685 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 317 transitions. Word has length 101 [2024-10-13 05:55:38,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:38,687 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 317 transitions. [2024-10-13 05:55:38,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-13 05:55:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 317 transitions. [2024-10-13 05:55:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 05:55:38,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:38,689 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] [2024-10-13 05:55:38,697 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-13 05:55:38,891 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-13 05:55:38,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:38,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1699723802, now seen corresponding path program 1 times [2024-10-13 05:55:38,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:38,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971126131] [2024-10-13 05:55:38,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:38,893 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-13 05:55:38,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:38,894 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-13 05:55:38,895 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-13 05:55:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:39,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 05:55:39,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:39,199 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-13 05:55:39,214 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 23 treesize of output 23 [2024-10-13 05:55:39,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:39,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-13 05:55:39,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:39,368 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 56 treesize of output 22 [2024-10-13 05:55:39,450 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-13 05:55:39,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:39,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:39,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971126131] [2024-10-13 05:55:39,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971126131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:39,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:39,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:55:39,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804320172] [2024-10-13 05:55:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:39,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:55:39,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:39,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:55:39,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:55:39,453 INFO L87 Difference]: Start difference. First operand 217 states and 317 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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-13 05:55:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:40,573 INFO L93 Difference]: Finished difference Result 680 states and 991 transitions. [2024-10-13 05:55:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 05:55:40,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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 101 [2024-10-13 05:55:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:40,578 INFO L225 Difference]: With dead ends: 680 [2024-10-13 05:55:40,578 INFO L226 Difference]: Without dead ends: 529 [2024-10-13 05:55:40,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:55:40,580 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 281 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:40,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 869 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 05:55:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-10-13 05:55:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 523. [2024-10-13 05:55:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 455 states have (on average 1.4043956043956043) internal successors, (639), 460 states have internal predecessors, (639), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 05:55:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 759 transitions. [2024-10-13 05:55:40,622 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 759 transitions. Word has length 101 [2024-10-13 05:55:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:40,624 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 759 transitions. [2024-10-13 05:55:40,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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-13 05:55:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 759 transitions. [2024-10-13 05:55:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 05:55:40,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:40,626 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-13 05:55:40,636 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 (7)] Ended with exit code 0 [2024-10-13 05:55:40,827 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-13 05:55:40,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:40,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1030614582, now seen corresponding path program 1 times [2024-10-13 05:55:40,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:40,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951522747] [2024-10-13 05:55:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:40,829 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-13 05:55:40,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:40,830 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-13 05:55:40,831 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-13 05:55:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:41,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 05:55:41,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:41,144 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-13 05:55:41,149 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-13 05:55:41,153 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-13 05:55:41,158 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-13 05:55:41,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:41,315 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 45 treesize of output 41 [2024-10-13 05:55:41,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:41,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 60 treesize of output 62 [2024-10-13 05:55:41,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:41,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 31 [2024-10-13 05:55:41,666 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-13 05:55:41,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:41,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:41,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951522747] [2024-10-13 05:55:41,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951522747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:41,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:41,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 05:55:41,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381984764] [2024-10-13 05:55:41,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:41,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:55:41,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:41,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:55:41,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:55:41,669 INFO L87 Difference]: Start difference. First operand 523 states and 759 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-13 05:55:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:43,026 INFO L93 Difference]: Finished difference Result 1236 states and 1787 transitions. [2024-10-13 05:55:43,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:55:43,027 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 103 [2024-10-13 05:55:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:43,032 INFO L225 Difference]: With dead ends: 1236 [2024-10-13 05:55:43,032 INFO L226 Difference]: Without dead ends: 807 [2024-10-13 05:55:43,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:43,034 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 329 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:43,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 655 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 05:55:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-10-13 05:55:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 799. [2024-10-13 05:55:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 710 states have (on average 1.412676056338028) internal successors, (1003), 719 states have internal predecessors, (1003), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 67 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-13 05:55:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1155 transitions. [2024-10-13 05:55:43,093 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1155 transitions. Word has length 103 [2024-10-13 05:55:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:43,094 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1155 transitions. [2024-10-13 05:55:43,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-13 05:55:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1155 transitions. [2024-10-13 05:55:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 05:55:43,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:43,097 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-13 05:55:43,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 05:55:43,298 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-13 05:55:43,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:43,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1691280276, now seen corresponding path program 1 times [2024-10-13 05:55:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65646697] [2024-10-13 05:55:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:43,299 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-13 05:55:43,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:43,303 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-13 05:55:43,304 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-13 05:55:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:43,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 05:55:43,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:43,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:43,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 26 [2024-10-13 05:55:43,673 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-13 05:55:43,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:43,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:43,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65646697] [2024-10-13 05:55:43,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65646697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:43,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:43,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:55:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340058854] [2024-10-13 05:55:43,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:43,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:55:43,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:43,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:55:43,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:55:43,676 INFO L87 Difference]: Start difference. First operand 799 states and 1155 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-13 05:55:48,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 05:55:50,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 05:55:52,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 05:55:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:53,164 INFO L93 Difference]: Finished difference Result 1649 states and 2385 transitions. [2024-10-13 05:55:53,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:55:53,178 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-13 05:55:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:53,184 INFO L225 Difference]: With dead ends: 1649 [2024-10-13 05:55:53,185 INFO L226 Difference]: Without dead ends: 957 [2024-10-13 05:55:53,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 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-13 05:55:53,187 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 100 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:53,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 459 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-10-13 05:55:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2024-10-13 05:55:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 949. [2024-10-13 05:55:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 850 states have (on average 1.4164705882352941) internal successors, (1204), 861 states have internal predecessors, (1204), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 73 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 05:55:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1372 transitions. [2024-10-13 05:55:53,259 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1372 transitions. Word has length 103 [2024-10-13 05:55:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:53,262 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1372 transitions. [2024-10-13 05:55:53,262 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-13 05:55:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1372 transitions. [2024-10-13 05:55:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 05:55:53,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:53,264 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-13 05:55:53,274 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 (9)] Forceful destruction successful, exit code 0 [2024-10-13 05:55:53,464 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-13 05:55:53,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:53,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1786038570, now seen corresponding path program 1 times [2024-10-13 05:55:53,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:53,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238105524] [2024-10-13 05:55:53,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:53,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-13 05:55:53,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:53,468 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-13 05:55:53,470 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-13 05:55:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:53,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 05:55:53,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:53,754 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-13 05:55:53,971 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 30 treesize of output 14 [2024-10-13 05:55:54,101 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 30 treesize of output 14 [2024-10-13 05:55:54,254 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 25 treesize of output 24 [2024-10-13 05:55:55,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:55,162 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 56 treesize of output 46 [2024-10-13 05:55:55,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:55,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 68 [2024-10-13 05:55:56,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:56,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 37 [2024-10-13 05:55:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-13 05:55:56,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:56,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:56,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238105524] [2024-10-13 05:55:56,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238105524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:56,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 05:55:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777779371] [2024-10-13 05:55:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:56,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 05:55:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:56,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 05:55:56,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:56,317 INFO L87 Difference]: Start difference. First operand 949 states and 1372 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-13 05:56:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:01,052 INFO L93 Difference]: Finished difference Result 1885 states and 2723 transitions. [2024-10-13 05:56:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:56:01,053 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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) Word has length 103 [2024-10-13 05:56:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:01,060 INFO L225 Difference]: With dead ends: 1885 [2024-10-13 05:56:01,060 INFO L226 Difference]: Without dead ends: 1084 [2024-10-13 05:56:01,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:56:01,063 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 550 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:01,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 735 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-13 05:56:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-10-13 05:56:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 971. [2024-10-13 05:56:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 872 states have (on average 1.4162844036697249) internal successors, (1235), 883 states have internal predecessors, (1235), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 73 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 05:56:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1403 transitions. [2024-10-13 05:56:01,151 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1403 transitions. Word has length 103 [2024-10-13 05:56:01,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:01,152 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1403 transitions. [2024-10-13 05:56:01,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-13 05:56:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1403 transitions. [2024-10-13 05:56:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 05:56:01,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:01,154 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-13 05:56:01,165 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-13 05:56:01,355 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-13 05:56:01,355 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:01,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:01,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1249469300, now seen corresponding path program 1 times [2024-10-13 05:56:01,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:56:01,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712682243] [2024-10-13 05:56:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:01,358 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-13 05:56:01,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:56:01,359 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-13 05:56:01,361 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-13 05:56:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:01,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 05:56:01,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:56:01,611 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-13 05:56:02,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-10-13 05:56:03,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:56:03,386 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 51 treesize of output 32 [2024-10-13 05:56:04,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:56:04,654 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 70 treesize of output 54 [2024-10-13 05:56:05,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:56:05,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62 [2024-10-13 05:56:05,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:56:05,696 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 80 treesize of output 40 [2024-10-13 05:56:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 173 proven. 18 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-13 05:56:05,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:56:06,807 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-13 05:56:06,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:56:06,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712682243] [2024-10-13 05:56:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712682243] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:56:06,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:56:06,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 20 [2024-10-13 05:56:06,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351591095] [2024-10-13 05:56:06,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:06,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:56:06,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:56:06,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:56:06,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-10-13 05:56:06,810 INFO L87 Difference]: Start difference. First operand 971 states and 1403 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)