./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-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-44.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 eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:24:56,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:24:56,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:24:56,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:24:56,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:24:56,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:24:56,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:24:56,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:24:56,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:24:56,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:24:56,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:24:56,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:24:56,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:24:56,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:24:56,303 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:24:56,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:24:56,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:24:56,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:24:56,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:24:56,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:24:56,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:24:56,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:24:56,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:24:56,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:24:56,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:24:56,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:24:56,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:24:56,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:24:56,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:24:56,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:24:56,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:24:56,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:24:56,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:24:56,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:24:56,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:24:56,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:24:56,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:24:56,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:24:56,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:24:56,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:24:56,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:24:56,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:24:56,313 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 -> eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 [2024-10-14 13:24:56,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:24:56,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:24:56,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:24:56,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:24:56,664 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:24:56,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-10-14 13:24:58,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:24:58,357 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:24:58,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-10-14 13:24:58,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9caa4b57/94ab1f0212c648539f6d0836350e634e/FLAG55c7d96d2 [2024-10-14 13:24:58,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9caa4b57/94ab1f0212c648539f6d0836350e634e [2024-10-14 13:24:58,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:24:58,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:24:58,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:24:58,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:24:58,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:24:58,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e1c444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58, skipping insertion in model container [2024-10-14 13:24:58,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:24:58,611 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-44.i[916,929] [2024-10-14 13:24:58,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:24:58,717 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:24:58,731 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-44.i[916,929] [2024-10-14 13:24:58,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:24:58,801 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:24:58,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58 WrapperNode [2024-10-14 13:24:58,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:24:58,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:24:58,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:24:58,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:24:58,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,873 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2024-10-14 13:24:58,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:24:58,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:24:58,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:24:58,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:24:58,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,932 INFO L175 MemorySlicer]: Split 131 memory accesses to 7 slices as follows [2, 36, 8, 19, 38, 17, 11]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 1, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 1, 2, 4, 2, 1]. [2024-10-14 13:24:58,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:24:58,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:24:58,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:24:58,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:24:58,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (1/1) ... [2024-10-14 13:24:58,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:24:58,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:24:59,020 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-14 13:24:59,022 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-14 13:24:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:24:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:24:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:24:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:24:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:24:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:24:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:24:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-14 13:24:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:24:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:24:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:24:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:24:59,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:24:59,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:24:59,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 13:24:59,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:24:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:24:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:24:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:24:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:24:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:24:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-14 13:24:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:24:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:24:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:24:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:24:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:24:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:24:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 13:24:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:24:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:24:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:24:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:24:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:24:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:24:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-14 13:24:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:24:59,086 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:24:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:24:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:24:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:24:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:24:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:24:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:24:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 13:24:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:24:59,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:24:59,261 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:24:59,263 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:24:59,838 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-14 13:24:59,839 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:24:59,870 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:24:59,870 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:24:59,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:24:59 BoogieIcfgContainer [2024-10-14 13:24:59,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:24:59,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:24:59,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:24:59,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:24:59,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:24:58" (1/3) ... [2024-10-14 13:24:59,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dbd877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:24:59, skipping insertion in model container [2024-10-14 13:24:59,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:24:58" (2/3) ... [2024-10-14 13:24:59,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dbd877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:24:59, skipping insertion in model container [2024-10-14 13:24:59,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:24:59" (3/3) ... [2024-10-14 13:24:59,881 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-44.i [2024-10-14 13:24:59,894 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:24:59,895 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:24:59,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:24:59,984 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;@509657b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:24:59,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:24:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 13:25:00,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:25:00,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:00,007 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:00,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:00,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:00,016 INFO L85 PathProgramCache]: Analyzing trace with hash 247804695, now seen corresponding path program 1 times [2024-10-14 13:25:00,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:00,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273488964] [2024-10-14 13:25:00,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:00,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:00,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:00,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273488964] [2024-10-14 13:25:00,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273488964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:00,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:00,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:25:00,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022167239] [2024-10-14 13:25:00,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:00,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:25:00,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:00,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:25:00,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:25:00,594 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:00,664 INFO L93 Difference]: Finished difference Result 219 states and 349 transitions. [2024-10-14 13:25:00,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:25:00,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 154 [2024-10-14 13:25:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:00,679 INFO L225 Difference]: With dead ends: 219 [2024-10-14 13:25:00,679 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 13:25:00,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-14 13:25:00,689 INFO L432 NwaCegarLoop]: 156 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, 156 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-14 13:25:00,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:25:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 13:25:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-14 13:25:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 13:25:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-10-14 13:25:00,744 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 154 [2024-10-14 13:25:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:00,745 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-10-14 13:25:00,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-10-14 13:25:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:25:00,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:00,749 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:00,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:25:00,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:00,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash 294632049, now seen corresponding path program 1 times [2024-10-14 13:25:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:00,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921690229] [2024-10-14 13:25:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:00,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:01,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:01,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921690229] [2024-10-14 13:25:01,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921690229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:01,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:01,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:25:01,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697581370] [2024-10-14 13:25:01,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:01,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:25:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:01,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:25:01,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:25:01,221 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:01,277 INFO L93 Difference]: Finished difference Result 220 states and 323 transitions. [2024-10-14 13:25:01,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:25:01,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-14 13:25:01,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:01,281 INFO L225 Difference]: With dead ends: 220 [2024-10-14 13:25:01,282 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 13:25:01,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-14 13:25:01,285 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:01,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:25:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 13:25:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-14 13:25:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 88 states have internal predecessors, (120), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 13:25:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2024-10-14 13:25:01,298 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 154 [2024-10-14 13:25:01,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:01,300 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2024-10-14 13:25:01,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2024-10-14 13:25:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:25:01,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:01,304 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:01,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:25:01,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:01,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:01,305 INFO L85 PathProgramCache]: Analyzing trace with hash 294691631, now seen corresponding path program 1 times [2024-10-14 13:25:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:01,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707306473] [2024-10-14 13:25:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:01,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:01,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:01,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707306473] [2024-10-14 13:25:01,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707306473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:01,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:01,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:25:01,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065215845] [2024-10-14 13:25:01,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:01,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:25:01,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:01,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:25:01,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:25:01,816 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:02,000 INFO L93 Difference]: Finished difference Result 319 states and 465 transitions. [2024-10-14 13:25:02,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:25:02,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-14 13:25:02,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:02,003 INFO L225 Difference]: With dead ends: 319 [2024-10-14 13:25:02,003 INFO L226 Difference]: Without dead ends: 209 [2024-10-14 13:25:02,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:25:02,005 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 128 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:02,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 800 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:25:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-14 13:25:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-10-14 13:25:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 166 states have (on average 1.3674698795180722) internal successors, (227), 167 states have internal predecessors, (227), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 13:25:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 301 transitions. [2024-10-14 13:25:02,024 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 301 transitions. Word has length 154 [2024-10-14 13:25:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:02,025 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 301 transitions. [2024-10-14 13:25:02,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 301 transitions. [2024-10-14 13:25:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 13:25:02,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:02,032 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:02,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:25:02,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:02,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:02,033 INFO L85 PathProgramCache]: Analyzing trace with hash -481451627, now seen corresponding path program 1 times [2024-10-14 13:25:02,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:02,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886691768] [2024-10-14 13:25:02,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:02,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886691768] [2024-10-14 13:25:02,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886691768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:02,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:02,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:25:02,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070152655] [2024-10-14 13:25:02,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:02,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:25:02,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:02,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:25:02,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:25:02,508 INFO L87 Difference]: Start difference. First operand 206 states and 301 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:02,763 INFO L93 Difference]: Finished difference Result 448 states and 652 transitions. [2024-10-14 13:25:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:25:02,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 155 [2024-10-14 13:25:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:02,768 INFO L225 Difference]: With dead ends: 448 [2024-10-14 13:25:02,768 INFO L226 Difference]: Without dead ends: 243 [2024-10-14 13:25:02,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:25:02,770 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 112 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:02,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1046 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:25:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-14 13:25:02,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2024-10-14 13:25:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 191 states have internal predecessors, (255), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-14 13:25:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 349 transitions. [2024-10-14 13:25:02,816 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 349 transitions. Word has length 155 [2024-10-14 13:25:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:02,819 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 349 transitions. [2024-10-14 13:25:02,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 349 transitions. [2024-10-14 13:25:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 13:25:02,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:02,822 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:02,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:25:02,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:02,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash -346249596, now seen corresponding path program 1 times [2024-10-14 13:25:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:02,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438616897] [2024-10-14 13:25:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:03,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:03,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438616897] [2024-10-14 13:25:03,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438616897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:03,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:03,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:25:03,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661015903] [2024-10-14 13:25:03,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:03,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:25:03,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:03,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:25:03,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:25:03,084 INFO L87 Difference]: Start difference. First operand 240 states and 349 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:03,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:03,136 INFO L93 Difference]: Finished difference Result 455 states and 659 transitions. [2024-10-14 13:25:03,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:25:03,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 156 [2024-10-14 13:25:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:03,140 INFO L225 Difference]: With dead ends: 455 [2024-10-14 13:25:03,140 INFO L226 Difference]: Without dead ends: 246 [2024-10-14 13:25:03,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:25:03,142 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:03,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:25:03,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-14 13:25:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-14 13:25:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 195 states have (on average 1.3384615384615384) internal successors, (261), 197 states have internal predecessors, (261), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-14 13:25:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 355 transitions. [2024-10-14 13:25:03,175 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 355 transitions. Word has length 156 [2024-10-14 13:25:03,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:03,177 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 355 transitions. [2024-10-14 13:25:03,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 355 transitions. [2024-10-14 13:25:03,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 13:25:03,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:03,179 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:03,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:25:03,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:03,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:03,180 INFO L85 PathProgramCache]: Analyzing trace with hash -661075625, now seen corresponding path program 1 times [2024-10-14 13:25:03,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:03,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571370114] [2024-10-14 13:25:03,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:03,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571370114] [2024-10-14 13:25:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571370114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:03,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:03,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:25:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525624932] [2024-10-14 13:25:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:03,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:25:03,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:03,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:25:03,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:25:03,593 INFO L87 Difference]: Start difference. First operand 246 states and 355 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:03,797 INFO L93 Difference]: Finished difference Result 466 states and 662 transitions. [2024-10-14 13:25:03,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:25:03,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 158 [2024-10-14 13:25:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:03,801 INFO L225 Difference]: With dead ends: 466 [2024-10-14 13:25:03,801 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 13:25:03,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:25:03,804 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 104 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:03,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 617 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:25:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 13:25:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 214. [2024-10-14 13:25:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 172 states have (on average 1.3255813953488371) internal successors, (228), 173 states have internal predecessors, (228), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 13:25:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 302 transitions. [2024-10-14 13:25:03,828 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 302 transitions. Word has length 158 [2024-10-14 13:25:03,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:03,829 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 302 transitions. [2024-10-14 13:25:03,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 302 transitions. [2024-10-14 13:25:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 13:25:03,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:03,832 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:03,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:25:03,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:03,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1381193857, now seen corresponding path program 1 times [2024-10-14 13:25:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:03,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238838694] [2024-10-14 13:25:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:03,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:03,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:04,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:04,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238838694] [2024-10-14 13:25:04,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238838694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:04,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:04,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 13:25:04,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616099381] [2024-10-14 13:25:04,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:04,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 13:25:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:04,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 13:25:04,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 13:25:04,016 INFO L87 Difference]: Start difference. First operand 214 states and 302 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:04,039 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2024-10-14 13:25:04,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 13:25:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 158 [2024-10-14 13:25:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:04,041 INFO L225 Difference]: With dead ends: 427 [2024-10-14 13:25:04,041 INFO L226 Difference]: Without dead ends: 214 [2024-10-14 13:25:04,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-14 13:25:04,043 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:04,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:25:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-14 13:25:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-10-14 13:25:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 172 states have (on average 1.313953488372093) internal successors, (226), 173 states have internal predecessors, (226), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 13:25:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 300 transitions. [2024-10-14 13:25:04,056 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 300 transitions. Word has length 158 [2024-10-14 13:25:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:04,057 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 300 transitions. [2024-10-14 13:25:04,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 300 transitions. [2024-10-14 13:25:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 13:25:04,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:04,059 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:04,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:25:04,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:04,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:04,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1833182397, now seen corresponding path program 1 times [2024-10-14 13:25:04,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:04,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108372986] [2024-10-14 13:25:04,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:04,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:04,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:04,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108372986] [2024-10-14 13:25:04,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108372986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:04,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:04,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:25:04,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57300790] [2024-10-14 13:25:04,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:04,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:25:04,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:04,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:25:04,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:25:04,414 INFO L87 Difference]: Start difference. First operand 214 states and 300 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:04,667 INFO L93 Difference]: Finished difference Result 622 states and 870 transitions. [2024-10-14 13:25:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:25:04,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-10-14 13:25:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:04,670 INFO L225 Difference]: With dead ends: 622 [2024-10-14 13:25:04,670 INFO L226 Difference]: Without dead ends: 409 [2024-10-14 13:25:04,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:25:04,671 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 121 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:04,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 837 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:25:04,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-14 13:25:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 405. [2024-10-14 13:25:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 331 states have (on average 1.3202416918429003) internal successors, (437), 334 states have internal predecessors, (437), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-14 13:25:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 567 transitions. [2024-10-14 13:25:04,697 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 567 transitions. Word has length 159 [2024-10-14 13:25:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:04,698 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 567 transitions. [2024-10-14 13:25:04,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 567 transitions. [2024-10-14 13:25:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 13:25:04,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:04,700 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:04,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:25:04,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:04,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:04,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1246376383, now seen corresponding path program 1 times [2024-10-14 13:25:04,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:04,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061136968] [2024-10-14 13:25:04,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:04,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:05,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:05,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061136968] [2024-10-14 13:25:05,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061136968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:05,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:05,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:25:05,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322070752] [2024-10-14 13:25:05,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:05,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:25:05,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:25:05,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:25:05,212 INFO L87 Difference]: Start difference. First operand 405 states and 567 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:05,349 INFO L93 Difference]: Finished difference Result 1213 states and 1699 transitions. [2024-10-14 13:25:05,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:25:05,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-10-14 13:25:05,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:05,354 INFO L225 Difference]: With dead ends: 1213 [2024-10-14 13:25:05,354 INFO L226 Difference]: Without dead ends: 809 [2024-10-14 13:25:05,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-14 13:25:05,356 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 97 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:05,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 401 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:25:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-10-14 13:25:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 783. [2024-10-14 13:25:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 636 states have (on average 1.3081761006289307) internal successors, (832), 642 states have internal predecessors, (832), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 124 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-14 13:25:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1092 transitions. [2024-10-14 13:25:05,413 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1092 transitions. Word has length 159 [2024-10-14 13:25:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:05,414 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1092 transitions. [2024-10-14 13:25:05,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1092 transitions. [2024-10-14 13:25:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 13:25:05,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:05,416 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:05,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 13:25:05,416 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:05,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:05,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1655831906, now seen corresponding path program 1 times [2024-10-14 13:25:05,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:05,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890712860] [2024-10-14 13:25:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:05,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:05,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:05,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890712860] [2024-10-14 13:25:05,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890712860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:05,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:05,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:25:05,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270150980] [2024-10-14 13:25:05,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:05,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:25:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:05,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:25:05,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:25:05,604 INFO L87 Difference]: Start difference. First operand 783 states and 1092 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:05,701 INFO L93 Difference]: Finished difference Result 1569 states and 2187 transitions. [2024-10-14 13:25:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:25:05,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 160 [2024-10-14 13:25:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:05,707 INFO L225 Difference]: With dead ends: 1569 [2024-10-14 13:25:05,707 INFO L226 Difference]: Without dead ends: 787 [2024-10-14 13:25:05,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-14 13:25:05,710 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 2 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:05,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 444 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:25:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-14 13:25:05,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 783. [2024-10-14 13:25:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 636 states have (on average 1.2955974842767295) internal successors, (824), 642 states have internal predecessors, (824), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 124 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-14 13:25:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1084 transitions. [2024-10-14 13:25:05,782 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1084 transitions. Word has length 160 [2024-10-14 13:25:05,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:05,782 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1084 transitions. [2024-10-14 13:25:05,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1084 transitions. [2024-10-14 13:25:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 13:25:05,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:05,785 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:05,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:25:05,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:05,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:05,786 INFO L85 PathProgramCache]: Analyzing trace with hash -862870263, now seen corresponding path program 1 times [2024-10-14 13:25:05,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:05,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076313337] [2024-10-14 13:25:05,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:05,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:06,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:06,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076313337] [2024-10-14 13:25:06,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076313337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:06,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:06,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:25:06,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041331956] [2024-10-14 13:25:06,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:06,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:25:06,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:06,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:25:06,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:25:06,387 INFO L87 Difference]: Start difference. First operand 783 states and 1084 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:06,719 INFO L93 Difference]: Finished difference Result 1971 states and 2726 transitions. [2024-10-14 13:25:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 13:25:06,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2024-10-14 13:25:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:06,727 INFO L225 Difference]: With dead ends: 1971 [2024-10-14 13:25:06,727 INFO L226 Difference]: Without dead ends: 1189 [2024-10-14 13:25:06,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:25:06,730 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 126 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:06,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1425 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:25:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2024-10-14 13:25:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1183. [2024-10-14 13:25:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 964 states have (on average 1.2883817427385893) internal successors, (1242), 974 states have internal predecessors, (1242), 194 states have call successors, (194), 24 states have call predecessors, (194), 24 states have return successors, (194), 184 states have call predecessors, (194), 194 states have call successors, (194) [2024-10-14 13:25:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1630 transitions. [2024-10-14 13:25:06,828 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1630 transitions. Word has length 161 [2024-10-14 13:25:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:06,828 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1630 transitions. [2024-10-14 13:25:06,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1630 transitions. [2024-10-14 13:25:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 13:25:06,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:06,831 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:06,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 13:25:06,831 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:06,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash -996883769, now seen corresponding path program 1 times [2024-10-14 13:25:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179614170] [2024-10-14 13:25:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:08,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:08,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179614170] [2024-10-14 13:25:08,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179614170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:08,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:08,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 13:25:08,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960032940] [2024-10-14 13:25:08,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:08,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 13:25:08,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:08,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 13:25:08,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:25:08,065 INFO L87 Difference]: Start difference. First operand 1183 states and 1630 transitions. Second operand has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-14 13:25:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:09,140 INFO L93 Difference]: Finished difference Result 2361 states and 3252 transitions. [2024-10-14 13:25:09,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 13:25:09,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 161 [2024-10-14 13:25:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:09,151 INFO L225 Difference]: With dead ends: 2361 [2024-10-14 13:25:09,152 INFO L226 Difference]: Without dead ends: 1179 [2024-10-14 13:25:09,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:25:09,156 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 125 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:09,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1623 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 13:25:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-10-14 13:25:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177. [2024-10-14 13:25:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 958 states have (on average 1.2860125260960333) internal successors, (1232), 968 states have internal predecessors, (1232), 194 states have call successors, (194), 24 states have call predecessors, (194), 24 states have return successors, (194), 184 states have call predecessors, (194), 194 states have call successors, (194) [2024-10-14 13:25:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1620 transitions. [2024-10-14 13:25:09,247 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1620 transitions. Word has length 161 [2024-10-14 13:25:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:09,248 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1620 transitions. [2024-10-14 13:25:09,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-14 13:25:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1620 transitions. [2024-10-14 13:25:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 13:25:09,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:09,251 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:09,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 13:25:09,252 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:09,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1961661507, now seen corresponding path program 1 times [2024-10-14 13:25:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211023268] [2024-10-14 13:25:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:10,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211023268] [2024-10-14 13:25:10,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211023268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:10,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:10,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:25:10,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099939589] [2024-10-14 13:25:10,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:10,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:25:10,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:10,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:25:10,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:25:10,261 INFO L87 Difference]: Start difference. First operand 1177 states and 1620 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:11,281 INFO L93 Difference]: Finished difference Result 2394 states and 3296 transitions. [2024-10-14 13:25:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:25:11,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2024-10-14 13:25:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:11,288 INFO L225 Difference]: With dead ends: 2394 [2024-10-14 13:25:11,288 INFO L226 Difference]: Without dead ends: 1218 [2024-10-14 13:25:11,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:25:11,291 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 130 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:11,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1706 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 13:25:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2024-10-14 13:25:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1181. [2024-10-14 13:25:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 962 states have (on average 1.2848232848232848) internal successors, (1236), 972 states have internal predecessors, (1236), 194 states have call successors, (194), 24 states have call predecessors, (194), 24 states have return successors, (194), 184 states have call predecessors, (194), 194 states have call successors, (194) [2024-10-14 13:25:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1624 transitions. [2024-10-14 13:25:11,365 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1624 transitions. Word has length 161 [2024-10-14 13:25:11,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:11,365 INFO L471 AbstractCegarLoop]: Abstraction has 1181 states and 1624 transitions. [2024-10-14 13:25:11,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1624 transitions. [2024-10-14 13:25:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 13:25:11,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:11,368 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:11,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 13:25:11,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:11,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:11,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1374855493, now seen corresponding path program 1 times [2024-10-14 13:25:11,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:11,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308564722] [2024-10-14 13:25:11,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:11,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:11,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:11,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308564722] [2024-10-14 13:25:11,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308564722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:11,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:25:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412957689] [2024-10-14 13:25:11,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:11,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:25:11,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:11,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:25:11,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:25:11,614 INFO L87 Difference]: Start difference. First operand 1181 states and 1624 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:11,900 INFO L93 Difference]: Finished difference Result 2383 states and 3258 transitions. [2024-10-14 13:25:11,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:25:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2024-10-14 13:25:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:11,907 INFO L225 Difference]: With dead ends: 2383 [2024-10-14 13:25:11,907 INFO L226 Difference]: Without dead ends: 1203 [2024-10-14 13:25:11,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:25:11,910 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 117 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:11,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 841 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:25:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2024-10-14 13:25:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 701. [2024-10-14 13:25:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 572 states have (on average 1.2762237762237763) internal successors, (730), 576 states have internal predecessors, (730), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 13:25:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 950 transitions. [2024-10-14 13:25:11,976 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 950 transitions. Word has length 161 [2024-10-14 13:25:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:11,978 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 950 transitions. [2024-10-14 13:25:11,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 950 transitions. [2024-10-14 13:25:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 13:25:11,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:11,980 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:11,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 13:25:11,981 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:11,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1765687395, now seen corresponding path program 1 times [2024-10-14 13:25:11,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:11,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039962387] [2024-10-14 13:25:11,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:13,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:13,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039962387] [2024-10-14 13:25:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039962387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:13,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:25:13,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042021908] [2024-10-14 13:25:13,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:13,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:25:13,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:13,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:25:13,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:25:13,083 INFO L87 Difference]: Start difference. First operand 701 states and 950 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:13,439 INFO L93 Difference]: Finished difference Result 1647 states and 2212 transitions. [2024-10-14 13:25:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 13:25:13,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 162 [2024-10-14 13:25:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:13,444 INFO L225 Difference]: With dead ends: 1647 [2024-10-14 13:25:13,445 INFO L226 Difference]: Without dead ends: 947 [2024-10-14 13:25:13,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:25:13,448 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 38 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:13,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1091 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:25:13,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-10-14 13:25:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 783. [2024-10-14 13:25:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 654 states have (on average 1.2629969418960245) internal successors, (826), 658 states have internal predecessors, (826), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 13:25:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1046 transitions. [2024-10-14 13:25:13,503 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1046 transitions. Word has length 162 [2024-10-14 13:25:13,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:13,504 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1046 transitions. [2024-10-14 13:25:13,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1046 transitions. [2024-10-14 13:25:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 13:25:13,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:13,506 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:13,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 13:25:13,506 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:13,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:13,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2025116879, now seen corresponding path program 1 times [2024-10-14 13:25:13,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:13,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523278366] [2024-10-14 13:25:13,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:13,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:13,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:13,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523278366] [2024-10-14 13:25:13,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523278366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:25:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301141057] [2024-10-14 13:25:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:13,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:25:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:25:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:25:13,950 INFO L87 Difference]: Start difference. First operand 783 states and 1046 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:14,153 INFO L93 Difference]: Finished difference Result 1597 states and 2137 transitions. [2024-10-14 13:25:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:25:14,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 162 [2024-10-14 13:25:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:14,159 INFO L225 Difference]: With dead ends: 1597 [2024-10-14 13:25:14,159 INFO L226 Difference]: Without dead ends: 815 [2024-10-14 13:25:14,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-14 13:25:14,161 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 90 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:14,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 436 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:25:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-10-14 13:25:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 783. [2024-10-14 13:25:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 654 states have (on average 1.253822629969419) internal successors, (820), 658 states have internal predecessors, (820), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 13:25:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1040 transitions. [2024-10-14 13:25:14,215 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1040 transitions. Word has length 162 [2024-10-14 13:25:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:14,216 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1040 transitions. [2024-10-14 13:25:14,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1040 transitions. [2024-10-14 13:25:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 13:25:14,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:14,218 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:14,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 13:25:14,218 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:14,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:14,218 INFO L85 PathProgramCache]: Analyzing trace with hash -228457311, now seen corresponding path program 1 times [2024-10-14 13:25:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:14,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770830008] [2024-10-14 13:25:14,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:25:14,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346332138] [2024-10-14 13:25:14,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:14,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:25:14,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:25:14,362 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-14 13:25:14,363 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-14 13:25:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:14,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-14 13:25:14,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:25:14,788 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 27 treesize of output 11 [2024-10-14 13:25:14,813 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 27 treesize of output 11 [2024-10-14 13:25:14,836 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 27 treesize of output 11 [2024-10-14 13:25:14,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:25:14,907 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 17 treesize of output 13 [2024-10-14 13:25:15,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 84 [2024-10-14 13:25:15,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:25:15,527 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 89 treesize of output 67 [2024-10-14 13:25:15,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2024-10-14 13:25:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-14 13:25:15,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:25:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:17,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:17,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770830008] [2024-10-14 13:25:17,333 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:25:17,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346332138] [2024-10-14 13:25:17,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346332138] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:25:17,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:25:17,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-10-14 13:25:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870883972] [2024-10-14 13:25:17,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:17,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:25:17,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:17,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:25:17,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:25:17,336 INFO L87 Difference]: Start difference. First operand 783 states and 1040 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:18,557 INFO L93 Difference]: Finished difference Result 1911 states and 2560 transitions. [2024-10-14 13:25:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:25:18,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 162 [2024-10-14 13:25:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:18,566 INFO L225 Difference]: With dead ends: 1911 [2024-10-14 13:25:18,566 INFO L226 Difference]: Without dead ends: 1129 [2024-10-14 13:25:18,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-10-14 13:25:18,569 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 156 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:18,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 692 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 13:25:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2024-10-14 13:25:18,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 797. [2024-10-14 13:25:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 668 states have (on average 1.2455089820359282) internal successors, (832), 672 states have internal predecessors, (832), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 13:25:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1052 transitions. [2024-10-14 13:25:18,653 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1052 transitions. Word has length 162 [2024-10-14 13:25:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:18,653 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1052 transitions. [2024-10-14 13:25:18,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1052 transitions. [2024-10-14 13:25:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 13:25:18,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:18,656 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:18,678 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-14 13:25:18,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 13:25:18,861 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:18,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1874383041, now seen corresponding path program 1 times [2024-10-14 13:25:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655394190] [2024-10-14 13:25:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:25:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:25:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:25:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:25:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:25:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:25:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:25:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:25:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:25:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:25:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:25:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:25:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:25:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:25:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:25:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:25:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:25:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:25:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:25:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:25:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:25:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:19,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:25:19,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655394190] [2024-10-14 13:25:19,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655394190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:19,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:19,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:25:19,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976882184] [2024-10-14 13:25:19,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:19,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:25:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:25:19,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:25:19,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:25:19,150 INFO L87 Difference]: Start difference. First operand 797 states and 1052 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:19,464 INFO L93 Difference]: Finished difference Result 1635 states and 2170 transitions. [2024-10-14 13:25:19,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:25:19,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2024-10-14 13:25:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:19,472 INFO L225 Difference]: With dead ends: 1635 [2024-10-14 13:25:19,472 INFO L226 Difference]: Without dead ends: 1193 [2024-10-14 13:25:19,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:25:19,474 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 148 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:19,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 527 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:25:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-10-14 13:25:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1156. [2024-10-14 13:25:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 963 states have (on average 1.2429906542056075) internal successors, (1197), 969 states have internal predecessors, (1197), 165 states have call successors, (165), 27 states have call predecessors, (165), 27 states have return successors, (165), 159 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-14 13:25:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1527 transitions. [2024-10-14 13:25:19,606 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1527 transitions. Word has length 164 [2024-10-14 13:25:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:19,607 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1527 transitions. [2024-10-14 13:25:19,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1527 transitions. [2024-10-14 13:25:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 13:25:19,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:19,609 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:19,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 13:25:19,610 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1072579356, now seen corresponding path program 1 times [2024-10-14 13:25:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:25:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777509440] [2024-10-14 13:25:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:25:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:25:19,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409788479] [2024-10-14 13:25:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:19,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:25:19,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:25:19,731 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-14 13:25:19,732 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-14 13:25:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:25:20,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:25:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:25:20,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:25:20,539 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:25:20,540 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:25:20,563 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-14 13:25:20,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:25:20,745 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] [2024-10-14 13:25:20,870 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:25:20,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:25:20 BoogieIcfgContainer [2024-10-14 13:25:20,873 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:25:20,873 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:25:20,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:25:20,874 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:25:20,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:24:59" (3/4) ... [2024-10-14 13:25:20,876 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:25:20,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:25:20,878 INFO L158 Benchmark]: Toolchain (without parser) took 22484.34ms. Allocated memory was 176.2MB in the beginning and 616.6MB in the end (delta: 440.4MB). Free memory was 146.4MB in the beginning and 353.2MB in the end (delta: -206.8MB). Peak memory consumption was 233.7MB. Max. memory is 16.1GB. [2024-10-14 13:25:20,878 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory was 146.4MB in the beginning and 146.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:25:20,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.02ms. Allocated memory is still 176.2MB. Free memory was 146.2MB in the beginning and 135.9MB in the end (delta: 10.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 13:25:20,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.88ms. Allocated memory is still 176.2MB. Free memory was 135.9MB in the beginning and 131.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:25:20,879 INFO L158 Benchmark]: Boogie Preprocessor took 94.57ms. Allocated memory is still 176.2MB. Free memory was 131.7MB in the beginning and 126.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:25:20,879 INFO L158 Benchmark]: RCFGBuilder took 900.67ms. Allocated memory is still 176.2MB. Free memory was 126.5MB in the beginning and 111.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 13:25:20,879 INFO L158 Benchmark]: TraceAbstraction took 20999.98ms. Allocated memory was 176.2MB in the beginning and 616.6MB in the end (delta: 440.4MB). Free memory was 111.6MB in the beginning and 353.2MB in the end (delta: -241.5MB). Peak memory consumption was 202.0MB. Max. memory is 16.1GB. [2024-10-14 13:25:20,879 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 616.6MB. Free memory is still 353.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:25:20,881 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 176.2MB. Free memory was 146.4MB in the beginning and 146.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.02ms. Allocated memory is still 176.2MB. Free memory was 146.2MB in the beginning and 135.9MB in the end (delta: 10.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.88ms. Allocated memory is still 176.2MB. Free memory was 135.9MB in the beginning and 131.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.57ms. Allocated memory is still 176.2MB. Free memory was 131.7MB in the beginning and 126.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 900.67ms. Allocated memory is still 176.2MB. Free memory was 126.5MB in the beginning and 111.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20999.98ms. Allocated memory was 176.2MB in the beginning and 616.6MB in the end (delta: 440.4MB). Free memory was 111.6MB in the beginning and 353.2MB in the end (delta: -241.5MB). Peak memory consumption was 202.0MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 616.6MB. Free memory is still 353.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someUnaryFLOAToperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L25-L27] double double_Array_0[1] = { 10.5 }; [L25-L27] double double_Array_0[1] = { 10.5 }; [L28-L30] float float_Array_0[2] = { 50.75, 32.6 }; [L28-L30] float float_Array_0[2] = { 50.75, 32.6 }; [L28-L30] float float_Array_0[2] = { 50.75, 32.6 }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L34-L36] signed long int signed_long_int_Array_0[1] = { 32 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { 32 }; [L37-L39] unsigned char unsigned_char_Array_0[1] = { 1 }; [L37-L39] unsigned char unsigned_char_Array_0[1] = { 1 }; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] float_Array_0[1] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[1] [L84] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L84] EXPR float_Array_0[1] [L84] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] 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}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] 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}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] 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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] 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}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L85] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L92] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L95] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_char_Array_0[1][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_char_Array_0[1][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L97] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L113] RET updateVariables() [L114] CALL step() [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L43] EXPR ((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]) [L43] EXPR signed_char_Array_0[1][1] [L43] EXPR ((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L43] EXPR unsigned_char_Array_0[0] [L43] signed long int stepLocal_1 = ((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]; [L44] EXPR signed_char_Array_0[1][0] [L44] EXPR signed_char_Array_0[0][0] [L44] signed long int stepLocal_0 = signed_char_Array_0[1][0] - signed_char_Array_0[0][0]; [L45] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L45] COND FALSE !(signed_char_Array_0[0][1] > stepLocal_0) [L50] EXPR signed_char_Array_0[1][1] [L50] signed_long_int_Array_0[0] = signed_char_Array_0[1][1] [L52] EXPR float_Array_0[1] [L52] float_Array_0[0] = float_Array_0[1] [L53] EXPR double_Array_0[0] [L53] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L53] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L53] EXPR float_Array_0[0] [L53] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=0, unsigned_char_Array_0={9:0}] [L53] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L53] COND FALSE !((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) [L56] EXPR signed_long_int_Array_0[0] [L56] signed long int stepLocal_3 = signed_long_int_Array_0[0]; [L57] EXPR signed_long_int_Array_0[0] [L57] EXPR signed_long_int_Array_0[0] [L57] EXPR signed_char_Array_0[0][0] [L57] signed long int stepLocal_2 = signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]); [L58] BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L58] COND TRUE BOOL_unsigned_char_Array_0[0][1] [L59] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L59] COND FALSE !(stepLocal_3 > signed_long_int_Array_0[0]) [L62] EXPR signed_long_int_Array_0[0] [L62] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L62] COND TRUE (signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < stepLocal_2 [L63] EXPR BOOL_unsigned_char_Array_0[1][0] [L63] BOOL_unsigned_char_Array_0[0][0] = BOOL_unsigned_char_Array_0[1][0] [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR signed_char_Array_0[0][1] [L105] EXPR signed_char_Array_0[1][0] [L105] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1])) [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR signed_char_Array_0[1][1] [L105] EXPR (signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1) [L105] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1 [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1) [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR unsigned_char_Array_0[0] [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[0][0] [L105] EXPR BOOL_unsigned_char_Array_0[1][0] [L105] EXPR ((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1) [L105] EXPR double_Array_0[0] [L105] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L105] EXPR float_Array_0[0] [L105] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1 [L105] EXPR ((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) [L105] EXPR float_Array_0[0] [L105] EXPR float_Array_0[1] [L105] EXPR ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105-L106] return ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 19, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1500 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1495 mSDsluCounter, 14004 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10641 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2703 IncrementalHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 3363 mSDtfsCounter, 2703 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1197 GetRequests, 1098 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1183occurred in iteration=11, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 1190 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 3355 NumberOfCodeBlocks, 3355 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3004 ConstructedInterpolants, 0 QuantifiedInterpolants, 11001 SizeOfPredicates, 13 NumberOfNonLiveVariables, 551 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 15930/15960 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-14 13:25:20,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-44.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 eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:25:23,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:25:23,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:25:23,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:25:23,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:25:23,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:25:23,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:25:23,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:25:23,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:25:23,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:25:23,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:25:23,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:25:23,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:25:23,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:25:23,240 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:25:23,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:25:23,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:25:23,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:25:23,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:25:23,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:25:23,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:25:23,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:25:23,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:25:23,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:25:23,246 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:25:23,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:25:23,247 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:25:23,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:25:23,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:25:23,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:25:23,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:25:23,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:25:23,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:25:23,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:25:23,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:25:23,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:25:23,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:25:23,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:25:23,250 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:25:23,250 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:25:23,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:25:23,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:25:23,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:25:23,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:25:23,252 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:25:23,252 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 -> eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 [2024-10-14 13:25:23,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:25:23,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:25:23,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:25:23,588 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:25:23,589 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:25:23,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-10-14 13:25:25,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:25:25,317 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:25:25,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-10-14 13:25:25,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82a79bfac/4079ce2c3b204c42b7a5779ea14f7055/FLAGabbc5db43 [2024-10-14 13:25:25,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82a79bfac/4079ce2c3b204c42b7a5779ea14f7055 [2024-10-14 13:25:25,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:25:25,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:25:25,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:25:25,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:25:25,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:25:25,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470747cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25, skipping insertion in model container [2024-10-14 13:25:25,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:25:25,572 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-44.i[916,929] [2024-10-14 13:25:25,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:25:25,685 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:25:25,698 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-44.i[916,929] [2024-10-14 13:25:25,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:25:25,773 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:25:25,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25 WrapperNode [2024-10-14 13:25:25,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:25:25,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:25:25,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:25:25,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:25:25,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,847 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 489 [2024-10-14 13:25:25,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:25:25,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:25:25,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:25:25,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:25:25,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,896 INFO L175 MemorySlicer]: Split 131 memory accesses to 7 slices as follows [2, 36, 8, 19, 38, 17, 11]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 1, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 1, 2, 4, 2, 1]. [2024-10-14 13:25:25,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:25:25,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:25:25,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:25:25,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:25:25,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (1/1) ... [2024-10-14 13:25:25,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:25:26,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:25:26,021 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-14 13:25:26,025 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-14 13:25:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:25:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-14 13:25:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-14 13:25:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-14 13:25:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-14 13:25:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-14 13:25:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-14 13:25:26,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-14 13:25:26,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 13:25:26,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 13:25:26,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-14 13:25:26,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-14 13:25:26,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-14 13:25:26,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-14 13:25:26,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-14 13:25:26,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:25:26,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:25:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 13:25:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-14 13:25:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-14 13:25:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-14 13:25:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-14 13:25:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:25:26,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:25:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 13:25:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 13:25:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-14 13:25:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-14 13:25:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-14 13:25:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 13:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 13:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-14 13:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-14 13:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-14 13:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-14 13:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-14 13:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 13:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 13:25:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-14 13:25:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-14 13:25:26,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 13:25:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 13:25:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-14 13:25:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-14 13:25:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-14 13:25:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-14 13:25:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-14 13:25:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:25:26,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:25:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:25:26,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:25:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:25:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:25:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-14 13:25:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-14 13:25:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-14 13:25:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-14 13:25:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-14 13:25:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 13:25:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 13:25:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 13:25:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 13:25:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-14 13:25:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-14 13:25:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-14 13:25:26,254 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:25:26,256 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:25:31,188 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-14 13:25:31,188 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:25:31,240 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:25:31,243 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:25:31,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:25:31 BoogieIcfgContainer [2024-10-14 13:25:31,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:25:31,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:25:31,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:25:31,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:25:31,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:25:25" (1/3) ... [2024-10-14 13:25:31,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ef9ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:25:31, skipping insertion in model container [2024-10-14 13:25:31,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:25:25" (2/3) ... [2024-10-14 13:25:31,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ef9ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:25:31, skipping insertion in model container [2024-10-14 13:25:31,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:25:31" (3/3) ... [2024-10-14 13:25:31,253 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-44.i [2024-10-14 13:25:31,270 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:25:31,270 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:25:31,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:25:31,339 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;@2b327075, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:25:31,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:25:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 13:25:31,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:25:31,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:31,364 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:31,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 247804695, now seen corresponding path program 1 times [2024-10-14 13:25:31,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:25:31,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389262704] [2024-10-14 13:25:31,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:31,389 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-14 13:25:31,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:25:31,393 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-14 13:25:31,395 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-14 13:25:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:31,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:25:31,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:25:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-10-14 13:25:31,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:25:31,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:25:31,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389262704] [2024-10-14 13:25:31,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389262704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:31,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:31,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:25:31,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924016053] [2024-10-14 13:25:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:31,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:25:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:25:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:25:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:25:31,924 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:31,978 INFO L93 Difference]: Finished difference Result 219 states and 349 transitions. [2024-10-14 13:25:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:25:31,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 154 [2024-10-14 13:25:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:31,993 INFO L225 Difference]: With dead ends: 219 [2024-10-14 13:25:31,993 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 13:25:31,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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-14 13:25:32,002 INFO L432 NwaCegarLoop]: 156 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, 156 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-14 13:25:32,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:25:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 13:25:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-14 13:25:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 13:25:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-10-14 13:25:32,050 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 154 [2024-10-14 13:25:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:32,050 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-10-14 13:25:32,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-10-14 13:25:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:25:32,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:32,055 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:32,069 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-14 13:25:32,255 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-14 13:25:32,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:32,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:32,257 INFO L85 PathProgramCache]: Analyzing trace with hash 294632049, now seen corresponding path program 1 times [2024-10-14 13:25:32,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:25:32,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170165384] [2024-10-14 13:25:32,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:32,258 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-14 13:25:32,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:25:32,260 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-14 13:25:32,261 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-14 13:25:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:32,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 13:25:32,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:25:32,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-14 13:25:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:32,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:25:32,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:25:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170165384] [2024-10-14 13:25:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170165384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:32,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:32,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:25:32,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57727334] [2024-10-14 13:25:32,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:32,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:25:32,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:25:32,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:25:32,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:25:32,946 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:35,441 INFO L93 Difference]: Finished difference Result 313 states and 459 transitions. [2024-10-14 13:25:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:25:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-14 13:25:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:35,447 INFO L225 Difference]: With dead ends: 313 [2024-10-14 13:25:35,450 INFO L226 Difference]: Without dead ends: 205 [2024-10-14 13:25:35,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:25:35,452 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 128 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:35,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 800 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 13:25:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-14 13:25:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2024-10-14 13:25:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 162 states have (on average 1.376543209876543) internal successors, (223), 163 states have internal predecessors, (223), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 13:25:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 297 transitions. [2024-10-14 13:25:35,479 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 297 transitions. Word has length 154 [2024-10-14 13:25:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:35,480 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 297 transitions. [2024-10-14 13:25:35,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 297 transitions. [2024-10-14 13:25:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 13:25:35,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:35,483 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:35,498 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 (3)] Ended with exit code 0 [2024-10-14 13:25:35,684 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-14 13:25:35,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:35,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash -481511209, now seen corresponding path program 1 times [2024-10-14 13:25:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:25:35,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381857769] [2024-10-14 13:25:35,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:35,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:25:35,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:25:35,689 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-14 13:25:35,696 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-14 13:25:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:36,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:25:36,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:25:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 13:25:36,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:25:36,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:25:36,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381857769] [2024-10-14 13:25:36,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381857769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:36,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:36,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:25:36,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626907197] [2024-10-14 13:25:36,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:36,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:25:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:25:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:25:36,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:25:36,128 INFO L87 Difference]: Start difference. First operand 202 states and 297 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:36,217 INFO L93 Difference]: Finished difference Result 413 states and 607 transitions. [2024-10-14 13:25:36,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:25:36,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 155 [2024-10-14 13:25:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:36,222 INFO L225 Difference]: With dead ends: 413 [2024-10-14 13:25:36,222 INFO L226 Difference]: Without dead ends: 212 [2024-10-14 13:25:36,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:25:36,224 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:36,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 598 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:25:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-14 13:25:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2024-10-14 13:25:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 170 states have (on average 1.3588235294117648) internal successors, (231), 171 states have internal predecessors, (231), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 13:25:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 305 transitions. [2024-10-14 13:25:36,262 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 305 transitions. Word has length 155 [2024-10-14 13:25:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:36,262 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 305 transitions. [2024-10-14 13:25:36,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 13:25:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 305 transitions. [2024-10-14 13:25:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 13:25:36,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:36,266 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:36,278 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-14 13:25:36,466 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-14 13:25:36,467 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:36,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:36,468 INFO L85 PathProgramCache]: Analyzing trace with hash -481451627, now seen corresponding path program 1 times [2024-10-14 13:25:36,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:25:36,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299250418] [2024-10-14 13:25:36,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:36,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:25:36,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:25:36,472 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-14 13:25:36,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 13:25:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:36,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:25:36,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:25:37,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:25:37,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-10-14 13:25:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-14 13:25:37,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:25:37,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:25:37,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299250418] [2024-10-14 13:25:37,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299250418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:25:37,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:25:37,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:25:37,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555079187] [2024-10-14 13:25:37,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:25:37,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:25:37,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:25:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:25:37,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:25:37,108 INFO L87 Difference]: Start difference. First operand 210 states and 305 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:39,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 13:25:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:25:40,386 INFO L93 Difference]: Finished difference Result 421 states and 611 transitions. [2024-10-14 13:25:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:25:40,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 155 [2024-10-14 13:25:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:25:40,406 INFO L225 Difference]: With dead ends: 421 [2024-10-14 13:25:40,407 INFO L226 Difference]: Without dead ends: 212 [2024-10-14 13:25:40,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:25:40,408 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 130 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:25:40,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 503 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 13:25:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-14 13:25:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2024-10-14 13:25:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 170 states have (on average 1.3470588235294119) internal successors, (229), 171 states have internal predecessors, (229), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 13:25:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 303 transitions. [2024-10-14 13:25:40,440 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 303 transitions. Word has length 155 [2024-10-14 13:25:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:25:40,441 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 303 transitions. [2024-10-14 13:25:40,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 13:25:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 303 transitions. [2024-10-14 13:25:40,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 13:25:40,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:25:40,446 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:25:40,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 13:25:40,646 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-14 13:25:40,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:25:40,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:25:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1545530651, now seen corresponding path program 1 times [2024-10-14 13:25:40,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:25:40,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704583369] [2024-10-14 13:25:40,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:25:40,649 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-14 13:25:40,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:25:40,652 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-14 13:25:40,654 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-14 13:25:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:25:41,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 13:25:41,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:25:45,770 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 121 treesize of output 61 [2024-10-14 13:25:45,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:25:45,801 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 144 treesize of output 54 [2024-10-14 13:25:46,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:25:46,321 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 149 treesize of output 59 [2024-10-14 13:25:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 428 proven. 36 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-14 13:25:53,381 INFO L311 TraceCheckSpWp]: Computing backward predicates...