./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 19:21:12,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 19:21:12,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 19:21:12,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 19:21:12,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 19:21:12,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 19:21:12,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 19:21:12,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 19:21:12,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 19:21:12,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 19:21:12,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 19:21:12,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 19:21:12,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 19:21:12,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 19:21:12,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 19:21:12,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 19:21:12,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 19:21:12,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 19:21:12,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 19:21:12,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 19:21:12,340 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 19:21:12,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 19:21:12,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 19:21:12,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 19:21:12,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 19:21:12,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 19:21:12,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 19:21:12,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 19:21:12,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 19:21:12,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 19:21:12,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 19:21:12,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 19:21:12,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 19:21:12,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 19:21:12,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 19:21:12,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 19:21:12,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 19:21:12,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 19:21:12,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 19:21:12,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 19:21:12,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 19:21:12,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 19:21:12,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 19:21:12,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 19:21:12,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 19:21:12,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 19:21:12,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 19:21:12,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 19:21:12,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 19:21:12,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 19:21:12,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 19:21:12,383 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 19:21:12,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 19:21:12,384 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 19:21:12,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 19:21:12,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 19:21:12,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 19:21:12,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 19:21:12,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 19:21:12,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 19:21:12,385 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 19:21:12,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 19:21:12,386 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 19:21:12,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 19:21:12,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 19:21:12,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 19:21:12,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 19:21:12,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:21:12,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 19:21:12,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 19:21:12,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 19:21:12,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 19:21:12,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 19:21:12,388 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 19:21:12,388 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 19:21:12,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 19:21:12,388 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc [2022-07-13 19:21:12,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 19:21:12,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 19:21:12,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 19:21:12,681 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 19:21:12,681 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 19:21:12,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2022-07-13 19:21:12,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189444f25/17d4cc084b5f4cc797a775417dbb9d76/FLAGa07795aa7 [2022-07-13 19:21:13,165 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 19:21:13,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2022-07-13 19:21:13,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189444f25/17d4cc084b5f4cc797a775417dbb9d76/FLAGa07795aa7 [2022-07-13 19:21:13,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/189444f25/17d4cc084b5f4cc797a775417dbb9d76 [2022-07-13 19:21:13,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 19:21:13,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 19:21:13,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 19:21:13,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 19:21:13,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 19:21:13,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:21:13" (1/1) ... [2022-07-13 19:21:13,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7216d742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:13, skipping insertion in model container [2022-07-13 19:21:13,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:21:13" (1/1) ... [2022-07-13 19:21:13,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 19:21:13,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 19:21:13,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i[23607,23620] [2022-07-13 19:21:13,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:21:13,972 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 19:21:14,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i[23607,23620] [2022-07-13 19:21:14,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:21:14,083 INFO L208 MainTranslator]: Completed translation [2022-07-13 19:21:14,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14 WrapperNode [2022-07-13 19:21:14,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 19:21:14,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 19:21:14,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 19:21:14,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 19:21:14,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14" (1/1) ... [2022-07-13 19:21:14,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14" (1/1) ... [2022-07-13 19:21:14,168 INFO L137 Inliner]: procedures = 145, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 539 [2022-07-13 19:21:14,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 19:21:14,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 19:21:14,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 19:21:14,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 19:21:14,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14" (1/1) ... [2022-07-13 19:21:14,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14" (1/1) ... [2022-07-13 19:21:14,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14" (1/1) ... [2022-07-13 19:21:14,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14" (1/1) ... [2022-07-13 19:21:14,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14" (1/1) ... [2022-07-13 19:21:14,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14" (1/1) ... [2022-07-13 19:21:14,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14" (1/1) ... [2022-07-13 19:21:14,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 19:21:14,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 19:21:14,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 19:21:14,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 19:21:14,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14" (1/1) ... [2022-07-13 19:21:14,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:21:14,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:14,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 19:21:14,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 19:21:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 19:21:14,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 19:21:14,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 19:21:14,336 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 19:21:14,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 19:21:14,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 19:21:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 19:21:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2022-07-13 19:21:14,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2022-07-13 19:21:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-13 19:21:14,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-13 19:21:14,340 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-13 19:21:14,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-13 19:21:14,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 19:21:14,340 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-13 19:21:14,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-13 19:21:14,340 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:21:14,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:21:14,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 19:21:14,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 19:21:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-13 19:21:14,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-13 19:21:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 19:21:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-13 19:21:14,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-13 19:21:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 19:21:14,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 19:21:14,459 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 19:21:14,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 19:21:14,793 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2022-07-13 19:21:14,794 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-13 19:21:14,794 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:21:14,794 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:21:14,794 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-13 19:21:14,794 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:21:14,794 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-13 19:21:16,351 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 19:21:16,357 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 19:21:16,357 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 19:21:16,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:16 BoogieIcfgContainer [2022-07-13 19:21:16,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 19:21:16,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 19:21:16,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 19:21:16,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 19:21:16,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 07:21:13" (1/3) ... [2022-07-13 19:21:16,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fe920f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:21:16, skipping insertion in model container [2022-07-13 19:21:16,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:21:14" (2/3) ... [2022-07-13 19:21:16,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fe920f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:21:16, skipping insertion in model container [2022-07-13 19:21:16,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:16" (3/3) ... [2022-07-13 19:21:16,365 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2022-07-13 19:21:16,375 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 19:21:16,375 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 19:21:16,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 19:21:16,412 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1185adbf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4bc8b08d [2022-07-13 19:21:16,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 19:21:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 112 states have internal predecessors, (161), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-13 19:21:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 19:21:16,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:16,429 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:16,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash 246520095, now seen corresponding path program 1 times [2022-07-13 19:21:16,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:16,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772989855] [2022-07-13 19:21:16,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 19:21:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 19:21:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:21:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 19:21:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 19:21:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 19:21:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 19:21:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 19:21:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 19:21:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 19:21:16,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:16,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772989855] [2022-07-13 19:21:16,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772989855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:16,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:16,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 19:21:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563027741] [2022-07-13 19:21:16,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:16,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 19:21:16,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:16,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 19:21:16,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 19:21:16,851 INFO L87 Difference]: Start difference. First operand has 175 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 112 states have internal predecessors, (161), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:16,894 INFO L93 Difference]: Finished difference Result 348 states and 578 transitions. [2022-07-13 19:21:16,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 19:21:16,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-07-13 19:21:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:16,907 INFO L225 Difference]: With dead ends: 348 [2022-07-13 19:21:16,907 INFO L226 Difference]: Without dead ends: 171 [2022-07-13 19:21:16,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 19:21:16,916 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:16,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-13 19:21:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-13 19:21:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-13 19:21:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2022-07-13 19:21:16,961 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 72 [2022-07-13 19:21:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:16,962 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2022-07-13 19:21:16,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2022-07-13 19:21:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 19:21:16,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:16,967 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:16,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 19:21:16,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1330951645, now seen corresponding path program 1 times [2022-07-13 19:21:16,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:16,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930240469] [2022-07-13 19:21:16,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:16,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 19:21:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 19:21:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 19:21:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 19:21:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 19:21:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 19:21:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 19:21:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 19:21:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 19:21:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 19:21:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:17,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930240469] [2022-07-13 19:21:17,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930240469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:17,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:17,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:21:17,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877840905] [2022-07-13 19:21:17,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:17,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:21:17,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:17,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:21:17,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:17,183 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:17,225 INFO L93 Difference]: Finished difference Result 340 states and 520 transitions. [2022-07-13 19:21:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:21:17,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-07-13 19:21:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:17,228 INFO L225 Difference]: With dead ends: 340 [2022-07-13 19:21:17,228 INFO L226 Difference]: Without dead ends: 175 [2022-07-13 19:21:17,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:17,230 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:17,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 514 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-13 19:21:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-07-13 19:21:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-13 19:21:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2022-07-13 19:21:17,242 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 72 [2022-07-13 19:21:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:17,243 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2022-07-13 19:21:17,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2022-07-13 19:21:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 19:21:17,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:17,245 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:17,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 19:21:17,246 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:17,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1826847327, now seen corresponding path program 1 times [2022-07-13 19:21:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:17,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358852887] [2022-07-13 19:21:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:17,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 19:21:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:21:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 19:21:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 19:21:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 19:21:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 19:21:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 19:21:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 19:21:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 19:21:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 19:21:17,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:17,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358852887] [2022-07-13 19:21:17,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358852887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:17,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:17,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:21:17,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840208625] [2022-07-13 19:21:17,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:17,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:21:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:17,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:21:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:17,441 INFO L87 Difference]: Start difference. First operand 172 states and 262 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:17,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:17,479 INFO L93 Difference]: Finished difference Result 343 states and 524 transitions. [2022-07-13 19:21:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:21:17,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-07-13 19:21:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:17,482 INFO L225 Difference]: With dead ends: 343 [2022-07-13 19:21:17,482 INFO L226 Difference]: Without dead ends: 174 [2022-07-13 19:21:17,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:17,484 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:17,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 515 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-13 19:21:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2022-07-13 19:21:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-13 19:21:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2022-07-13 19:21:17,495 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 75 [2022-07-13 19:21:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:17,496 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2022-07-13 19:21:17,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2022-07-13 19:21:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 19:21:17,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:17,497 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:17,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 19:21:17,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash -541531615, now seen corresponding path program 1 times [2022-07-13 19:21:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:17,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562988726] [2022-07-13 19:21:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 19:21:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 19:21:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:21:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 19:21:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 19:21:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 19:21:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 19:21:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 19:21:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 19:21:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 19:21:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 19:21:17,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:17,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562988726] [2022-07-13 19:21:17,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562988726] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:17,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731856295] [2022-07-13 19:21:17,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:17,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:17,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:17,706 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) [2022-07-13 19:21:17,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 19:21:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:21:18,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 19:21:18,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 19:21:18,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731856295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:18,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:18,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-13 19:21:18,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946194450] [2022-07-13 19:21:18,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:18,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 19:21:18,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:18,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 19:21:18,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:18,395 INFO L87 Difference]: Start difference. First operand 173 states and 263 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-13 19:21:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:18,442 INFO L93 Difference]: Finished difference Result 347 states and 529 transitions. [2022-07-13 19:21:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 19:21:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-07-13 19:21:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:18,445 INFO L225 Difference]: With dead ends: 347 [2022-07-13 19:21:18,445 INFO L226 Difference]: Without dead ends: 177 [2022-07-13 19:21:18,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:18,447 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:18,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 515 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-13 19:21:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-07-13 19:21:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-13 19:21:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2022-07-13 19:21:18,468 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 77 [2022-07-13 19:21:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:18,468 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2022-07-13 19:21:18,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-13 19:21:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2022-07-13 19:21:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-13 19:21:18,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:18,470 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:18,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 19:21:18,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:18,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1454696411, now seen corresponding path program 2 times [2022-07-13 19:21:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:18,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19460460] [2022-07-13 19:21:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:21:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 19:21:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 19:21:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 19:21:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 19:21:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 19:21:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 19:21:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 19:21:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 19:21:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-07-13 19:21:18,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:18,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19460460] [2022-07-13 19:21:18,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19460460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:18,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35801760] [2022-07-13 19:21:18,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 19:21:18,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:18,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:18,880 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) [2022-07-13 19:21:18,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 19:21:19,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 19:21:19,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 19:21:19,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 19:21:19,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 19:21:19,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:21:19,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35801760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:19,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:21:19,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 19:21:19,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473224177] [2022-07-13 19:21:19,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:19,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 19:21:19,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:19,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 19:21:19,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:19,749 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:19,786 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-07-13 19:21:19,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 19:21:19,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-07-13 19:21:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:19,790 INFO L225 Difference]: With dead ends: 339 [2022-07-13 19:21:19,791 INFO L226 Difference]: Without dead ends: 313 [2022-07-13 19:21:19,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:21:19,792 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 208 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:19,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1001 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-13 19:21:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 312. [2022-07-13 19:21:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 198 states have (on average 1.4292929292929293) internal successors, (283), 198 states have internal predecessors, (283), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2022-07-13 19:21:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 485 transitions. [2022-07-13 19:21:19,819 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 485 transitions. Word has length 81 [2022-07-13 19:21:19,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:19,820 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 485 transitions. [2022-07-13 19:21:19,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 19:21:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 485 transitions. [2022-07-13 19:21:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-13 19:21:19,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:19,823 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:19,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:20,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:20,043 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash -613977023, now seen corresponding path program 1 times [2022-07-13 19:21:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:20,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313017510] [2022-07-13 19:21:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 19:21:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 19:21:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 19:21:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 19:21:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 19:21:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 19:21:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 19:21:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 19:21:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 19:21:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 19:21:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 19:21:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 19:21:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 19:21:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 19:21:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 19:21:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-13 19:21:20,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:20,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313017510] [2022-07-13 19:21:20,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313017510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:20,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877634456] [2022-07-13 19:21:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:20,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:20,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:20,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:20,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 19:21:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:21,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 2132 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:21:21,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-13 19:21:21,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-13 19:21:21,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877634456] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:21,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:21,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-07-13 19:21:21,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066036033] [2022-07-13 19:21:21,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:21,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 19:21:21,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:21,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 19:21:21,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 19:21:21,196 INFO L87 Difference]: Start difference. First operand 312 states and 485 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-13 19:21:23,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:25,290 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:25,677 INFO L93 Difference]: Finished difference Result 631 states and 988 transitions. [2022-07-13 19:21:25,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 19:21:25,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 155 [2022-07-13 19:21:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:25,680 INFO L225 Difference]: With dead ends: 631 [2022-07-13 19:21:25,680 INFO L226 Difference]: Without dead ends: 331 [2022-07-13 19:21:25,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:21:25,682 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 100 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 227 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:25,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 611 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 314 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-07-13 19:21:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-13 19:21:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2022-07-13 19:21:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 211 states have internal predecessors, (295), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-07-13 19:21:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 503 transitions. [2022-07-13 19:21:25,698 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 503 transitions. Word has length 155 [2022-07-13 19:21:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:25,698 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 503 transitions. [2022-07-13 19:21:25,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-13 19:21:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 503 transitions. [2022-07-13 19:21:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-13 19:21:25,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:25,701 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:25,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:25,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:25,923 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:25,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1817944839, now seen corresponding path program 2 times [2022-07-13 19:21:25,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:25,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997824097] [2022-07-13 19:21:25,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:21:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 19:21:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 19:21:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 19:21:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 19:21:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 19:21:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 19:21:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 19:21:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 19:21:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 19:21:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 19:21:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 19:21:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 19:21:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 19:21:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 19:21:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-07-13 19:21:36,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:36,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997824097] [2022-07-13 19:21:36,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997824097] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:36,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755417576] [2022-07-13 19:21:36,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 19:21:36,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:36,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:36,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:36,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 19:21:37,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 19:21:37,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 19:21:37,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 19:21:37,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-13 19:21:37,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:21:37,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755417576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:37,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:21:37,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-13 19:21:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667990785] [2022-07-13 19:21:37,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:37,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:21:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:37,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:21:37,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-13 19:21:37,438 INFO L87 Difference]: Start difference. First operand 325 states and 503 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:21:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:37,452 INFO L93 Difference]: Finished difference Result 619 states and 965 transitions. [2022-07-13 19:21:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:21:37,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 164 [2022-07-13 19:21:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:37,454 INFO L225 Difference]: With dead ends: 619 [2022-07-13 19:21:37,454 INFO L226 Difference]: Without dead ends: 325 [2022-07-13 19:21:37,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-13 19:21:37,456 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:37,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-13 19:21:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-07-13 19:21:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 209 states have (on average 1.4066985645933014) internal successors, (294), 211 states have internal predecessors, (294), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-07-13 19:21:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 502 transitions. [2022-07-13 19:21:37,468 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 502 transitions. Word has length 164 [2022-07-13 19:21:37,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:37,468 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 502 transitions. [2022-07-13 19:21:37,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-13 19:21:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 502 transitions. [2022-07-13 19:21:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-13 19:21:37,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:37,471 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:37,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:37,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:37,687 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 755632713, now seen corresponding path program 1 times [2022-07-13 19:21:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:37,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072614025] [2022-07-13 19:21:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:21:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:37,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:21:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:37,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:37,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 19:21:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 19:21:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 19:21:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 19:21:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 19:21:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 19:21:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 19:21:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 19:21:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 19:21:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 19:21:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 19:21:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 19:21:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 19:21:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 19:21:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2022-07-13 19:21:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:38,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072614025] [2022-07-13 19:21:38,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072614025] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:38,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375001913] [2022-07-13 19:21:38,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:38,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:38,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:38,074 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:38,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 19:21:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:39,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 2467 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 19:21:39,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:39,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-13 19:21:39,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-13 19:21:39,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-13 19:21:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2022-07-13 19:21:39,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:39,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-13 19:21:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-07-13 19:21:39,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375001913] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:39,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:39,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-13 19:21:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859231885] [2022-07-13 19:21:39,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:39,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 19:21:39,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:39,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 19:21:39,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-13 19:21:39,351 INFO L87 Difference]: Start difference. First operand 325 states and 502 transitions. Second operand has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 10 states have internal predecessors, (124), 10 states have call successors, (42), 8 states have call predecessors, (42), 7 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2022-07-13 19:21:41,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:42,946 INFO L93 Difference]: Finished difference Result 747 states and 1193 transitions. [2022-07-13 19:21:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 19:21:42,946 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 10 states have internal predecessors, (124), 10 states have call successors, (42), 8 states have call predecessors, (42), 7 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) Word has length 186 [2022-07-13 19:21:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:42,950 INFO L225 Difference]: With dead ends: 747 [2022-07-13 19:21:42,950 INFO L226 Difference]: Without dead ends: 717 [2022-07-13 19:21:42,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2022-07-13 19:21:42,951 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 1061 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 1040 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1040 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:42,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1136 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 1566 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-07-13 19:21:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-07-13 19:21:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 680. [2022-07-13 19:21:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 427 states have (on average 1.4285714285714286) internal successors, (610), 434 states have internal predecessors, (610), 211 states have call successors, (211), 32 states have call predecessors, (211), 41 states have return successors, (265), 213 states have call predecessors, (265), 211 states have call successors, (265) [2022-07-13 19:21:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1086 transitions. [2022-07-13 19:21:42,997 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1086 transitions. Word has length 186 [2022-07-13 19:21:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:42,998 INFO L495 AbstractCegarLoop]: Abstraction has 680 states and 1086 transitions. [2022-07-13 19:21:42,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 10 states have internal predecessors, (124), 10 states have call successors, (42), 8 states have call predecessors, (42), 7 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2022-07-13 19:21:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1086 transitions. [2022-07-13 19:21:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-13 19:21:43,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:43,002 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:43,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 19:21:43,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:43,225 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash 998047407, now seen corresponding path program 1 times [2022-07-13 19:21:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:43,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390945962] [2022-07-13 19:21:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:43,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:21:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 19:21:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 19:21:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 19:21:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 19:21:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 19:21:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 19:21:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 19:21:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-13 19:21:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 19:21:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 19:21:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 19:21:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 19:21:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 19:21:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 19:21:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 19:21:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-13 19:21:43,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:43,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390945962] [2022-07-13 19:21:43,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390945962] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:43,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465080392] [2022-07-13 19:21:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:43,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:43,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:43,644 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:43,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 19:21:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:44,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 2436 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 19:21:44,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:44,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-13 19:21:44,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-13 19:21:44,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-13 19:21:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-13 19:21:44,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:21:44,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465080392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:44,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:21:44,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-13 19:21:44,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551816635] [2022-07-13 19:21:44,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:44,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 19:21:44,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:44,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 19:21:44,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 19:21:44,709 INFO L87 Difference]: Start difference. First operand 680 states and 1086 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-13 19:21:44,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:44,806 INFO L93 Difference]: Finished difference Result 1342 states and 2141 transitions. [2022-07-13 19:21:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 19:21:44,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 187 [2022-07-13 19:21:44,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:44,810 INFO L225 Difference]: With dead ends: 1342 [2022-07-13 19:21:44,810 INFO L226 Difference]: Without dead ends: 696 [2022-07-13 19:21:44,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:21:44,813 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 272 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:44,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 904 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 19:21:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-07-13 19:21:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 686. [2022-07-13 19:21:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 431 states have (on average 1.4245939675174013) internal successors, (614), 440 states have internal predecessors, (614), 211 states have call successors, (211), 32 states have call predecessors, (211), 43 states have return successors, (268), 213 states have call predecessors, (268), 211 states have call successors, (268) [2022-07-13 19:21:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1093 transitions. [2022-07-13 19:21:44,839 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1093 transitions. Word has length 187 [2022-07-13 19:21:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:44,840 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 1093 transitions. [2022-07-13 19:21:44,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-13 19:21:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1093 transitions. [2022-07-13 19:21:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-13 19:21:44,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:44,843 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:44,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 19:21:45,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:45,065 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1865108637, now seen corresponding path program 1 times [2022-07-13 19:21:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:45,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499172365] [2022-07-13 19:21:45,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 19:21:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 19:21:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 19:21:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 19:21:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 19:21:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 19:21:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 19:21:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 19:21:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 19:21:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 19:21:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 19:21:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 19:21:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 19:21:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 19:21:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 19:21:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 19:21:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 19:21:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 19:21:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 19:21:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2022-07-13 19:21:53,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:53,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499172365] [2022-07-13 19:21:53,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499172365] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:53,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010881325] [2022-07-13 19:21:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:53,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:53,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:53,238 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:53,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 19:21:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:54,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 2464 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 19:21:54,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 72 proven. 126 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2022-07-13 19:21:54,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-07-13 19:21:54,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010881325] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:54,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:54,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 22 [2022-07-13 19:21:54,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137448945] [2022-07-13 19:21:54,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:54,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 19:21:54,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:54,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 19:21:54,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-07-13 19:21:54,837 INFO L87 Difference]: Start difference. First operand 686 states and 1093 transitions. Second operand has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2022-07-13 19:21:56,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:58,909 INFO L93 Difference]: Finished difference Result 1956 states and 3237 transitions. [2022-07-13 19:21:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 19:21:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) Word has length 186 [2022-07-13 19:21:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:58,910 INFO L225 Difference]: With dead ends: 1956 [2022-07-13 19:21:58,910 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 19:21:58,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 19:21:58,918 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 1027 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 1123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 3853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:58,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 1267 Invalid, 3853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 2729 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-07-13 19:21:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 19:21:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 19:21:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:21:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 19:21:58,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2022-07-13 19:21:58,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:58,920 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 19:21:58,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2022-07-13 19:21:58,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 19:21:58,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 19:21:58,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 19:21:58,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:59,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:59,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 19:22:02,826 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-07-13 19:22:02,826 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_initEXIT(lines 569 572) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L902 garLoopResultBuilder]: At program point __CS_pthread_mutex_initENTRY(lines 569 572) the Hoare annotation is: true [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_initFINAL(lines 569 572) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_joinEXIT(lines 642 663) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_joinENTRY(lines 642 663) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= ~__CS_error~0 |old(~__CS_error~0)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_joinFINAL(lines 642 663) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L895 garLoopResultBuilder]: At program point L661(line 661) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= ~__CS_error~0 |old(~__CS_error~0)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point L661-1(line 661) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point L655(lines 655 660) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point L650(line 650) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point L650-2(lines 650 654) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 649) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_mutex_lockENTRY(lines 582 587) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 585) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 584 585) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockEXIT(lines 582 587) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockFINAL(lines 582 587) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L895 garLoopResultBuilder]: At program point L729(line 729) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:22:02,827 INFO L899 garLoopResultBuilder]: For program point L729-1(lines 722 753) no Hoare annotation was computed. [2022-07-13 19:22:02,827 INFO L895 garLoopResultBuilder]: At program point L696(line 696) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) .cse0 .cse1))) [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point L696-1(line 696) no Hoare annotation was computed. [2022-07-13 19:22:02,828 INFO L895 garLoopResultBuilder]: At program point L713(line 713) the Hoare annotation is: (or (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point L713-1(lines 706 720) no Hoare annotation was computed. [2022-07-13 19:22:02,828 INFO L895 garLoopResultBuilder]: At program point L697(line 697) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point L697-1(lines 690 704) no Hoare annotation was computed. [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$FINAL(line -1) no Hoare annotation was computed. [2022-07-13 19:22:02,828 INFO L895 garLoopResultBuilder]: At program point L747(lines 743 751) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,828 INFO L895 garLoopResultBuilder]: At program point L714(line 714) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point L714-1(line 714) no Hoare annotation was computed. [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$EXIT(line -1) no Hoare annotation was computed. [2022-07-13 19:22:02,828 INFO L895 garLoopResultBuilder]: At program point L731(line 731) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point L731-1(lines 722 753) no Hoare annotation was computed. [2022-07-13 19:22:02,828 INFO L895 garLoopResultBuilder]: At program point L698(line 698) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point L698-1(line 698) no Hoare annotation was computed. [2022-07-13 19:22:02,828 INFO L895 garLoopResultBuilder]: At program point L715(line 715) the Hoare annotation is: (let ((.cse0 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse1 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (.cse2 (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (.cse3 (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1 .cse2 .cse3) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (let ((.cse4 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse0 .cse1 (<= .cse4 ~__CS_ret_PREEMPTED~0) .cse2 .cse3 (<= ~__CS_ret_PREEMPTED~0 .cse4))))) [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point L715-1(lines 706 720) no Hoare annotation was computed. [2022-07-13 19:22:02,828 INFO L895 garLoopResultBuilder]: At program point L699(line 699) the Hoare annotation is: (let ((.cse0 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse1 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1) (not (= ~__CS_ret_PREEMPTED~0 1)) (let ((.cse2 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse0 .cse1 (<= .cse2 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 .cse2))) (not (= (mod |old(~__CS_ret~0)| 256) 0)))) [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point L699-1(lines 690 704) no Hoare annotation was computed. [2022-07-13 19:22:02,828 INFO L895 garLoopResultBuilder]: At program point L733(line 733) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point L733-1(lines 722 753) no Hoare annotation was computed. [2022-07-13 19:22:02,828 INFO L895 garLoopResultBuilder]: At program point L717(line 717) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,828 INFO L899 garLoopResultBuilder]: For program point L717-1(lines 706 720) no Hoare annotation was computed. [2022-07-13 19:22:02,829 INFO L895 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:22:02,829 INFO L899 garLoopResultBuilder]: For program point L734-1(line 734) no Hoare annotation was computed. [2022-07-13 19:22:02,829 INFO L895 garLoopResultBuilder]: At program point L701(line 701) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,829 INFO L899 garLoopResultBuilder]: For program point L701-1(lines 690 704) no Hoare annotation was computed. [2022-07-13 19:22:02,829 INFO L895 garLoopResultBuilder]: At program point L718(line 718) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,829 INFO L899 garLoopResultBuilder]: For program point L718-1(line 718) no Hoare annotation was computed. [2022-07-13 19:22:02,829 INFO L895 garLoopResultBuilder]: At program point L735(line 735) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2022-07-13 19:22:02,829 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 722 753) no Hoare annotation was computed. [2022-07-13 19:22:02,829 INFO L895 garLoopResultBuilder]: At program point L702(line 702) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,829 INFO L899 garLoopResultBuilder]: For program point L702-1(line 702) no Hoare annotation was computed. [2022-07-13 19:22:02,829 INFO L899 garLoopResultBuilder]: For program point L752(lines 722 753) no Hoare annotation was computed. [2022-07-13 19:22:02,829 INFO L895 garLoopResultBuilder]: At program point L719(line 719) the Hoare annotation is: (or (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,829 INFO L899 garLoopResultBuilder]: For program point L719-1(lines 706 720) no Hoare annotation was computed. [2022-07-13 19:22:02,829 INFO L895 garLoopResultBuilder]: At program point L736(line 736) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2022-07-13 19:22:02,829 INFO L899 garLoopResultBuilder]: For program point L736-1(line 736) no Hoare annotation was computed. [2022-07-13 19:22:02,829 INFO L895 garLoopResultBuilder]: At program point L703(line 703) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) [2022-07-13 19:22:02,829 INFO L899 garLoopResultBuilder]: For program point L703-1(lines 690 704) no Hoare annotation was computed. [2022-07-13 19:22:02,829 INFO L895 garLoopResultBuilder]: At program point L737(line 737) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2022-07-13 19:22:02,829 INFO L899 garLoopResultBuilder]: For program point L737-1(lines 722 753) no Hoare annotation was computed. [2022-07-13 19:22:02,829 INFO L895 garLoopResultBuilder]: At program point L721(lines 721 753) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,829 INFO L895 garLoopResultBuilder]: At program point L738(line 738) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2022-07-13 19:22:02,829 INFO L899 garLoopResultBuilder]: For program point L738-1(line 738) no Hoare annotation was computed. [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point L705(lines 705 720) the Hoare annotation is: (or (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point L689(lines 689 704) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~$Pointer$ENTRY(line -1) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point L739(line 739) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,830 INFO L899 garLoopResultBuilder]: For program point L739-1(lines 722 753) no Hoare annotation was computed. [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point L740(line 740) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,830 INFO L899 garLoopResultBuilder]: For program point L740-1(line 740) no Hoare annotation was computed. [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point L707(line 707) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,830 INFO L899 garLoopResultBuilder]: For program point L707-1(lines 706 720) no Hoare annotation was computed. [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point L691(line 691) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,830 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 690 704) no Hoare annotation was computed. [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,830 INFO L899 garLoopResultBuilder]: For program point L741-1(lines 722 753) no Hoare annotation was computed. [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point L708(line 708) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:22:02,830 INFO L899 garLoopResultBuilder]: For program point L708-1(line 708) no Hoare annotation was computed. [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point L725(line 725) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,830 INFO L899 garLoopResultBuilder]: For program point L725-1(lines 722 753) no Hoare annotation was computed. [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point L692(line 692) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) .cse0 .cse1))) [2022-07-13 19:22:02,830 INFO L899 garLoopResultBuilder]: For program point L692-1(line 692) no Hoare annotation was computed. [2022-07-13 19:22:02,830 INFO L899 garLoopResultBuilder]: For program point L742(line 742) no Hoare annotation was computed. [2022-07-13 19:22:02,830 INFO L895 garLoopResultBuilder]: At program point L709(line 709) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (let ((.cse2 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse3 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (.cse4 (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (.cse5 (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse2 .cse3 .cse4 .cse5) .cse0 .cse1 (let ((.cse6 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse2 .cse3 (<= .cse6 ~__CS_ret_PREEMPTED~0) .cse4 .cse5 (<= ~__CS_ret_PREEMPTED~0 .cse6))))))) [2022-07-13 19:22:02,830 INFO L899 garLoopResultBuilder]: For program point L742-2(lines 742 751) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L709-1(lines 706 720) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L895 garLoopResultBuilder]: At program point L742-4(lines 742 751) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L726-1(line 726) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L895 garLoopResultBuilder]: At program point L693(line 693) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (let ((.cse2 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse3 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse2 .cse3) .cse0 (let ((.cse4 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse2 .cse3 (<= .cse4 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 .cse4))) .cse1)))) [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L693-1(lines 690 704) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L895 garLoopResultBuilder]: At program point L727(line 727) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L727-1(lines 722 753) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L895 garLoopResultBuilder]: At program point L744(line 744) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L744-1(lines 743 751) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L895 garLoopResultBuilder]: At program point L711(line 711) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L711-1(lines 706 720) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L895 garLoopResultBuilder]: At program point L728(line 728) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L728-1(line 728) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L895 garLoopResultBuilder]: At program point L695(line 695) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) .cse0 .cse1))) [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L695-1(lines 690 704) no Hoare annotation was computed. [2022-07-13 19:22:02,831 INFO L895 garLoopResultBuilder]: At program point L712(line 712) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:22:02,831 INFO L899 garLoopResultBuilder]: For program point L712-1(line 712) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_mutex_unlockENTRY(lines 588 596) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockFINAL(lines 588 596) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockEXIT(lines 588 596) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_createFINAL(lines 664 677) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L666(lines 666 669) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_createEXIT(lines 664 677) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_createENTRY(lines 664 677) the Hoare annotation is: (or (not (= (mod ~__CS_ret~0 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= ~__CS_ret_PREEMPTED~0 1))) [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 800) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L795-1(lines 795 800) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L754(lines 754 818) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L895 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L812-1(line 812) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L895 garLoopResultBuilder]: At program point L804(line 804) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L804-1(line 804) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L763-2(lines 763 772) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L895 garLoopResultBuilder]: At program point L763-3(lines 763 772) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0) (= 0 (select ~__CS_thread~0.base 2)) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L763-4(lines 763 772) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L895 garLoopResultBuilder]: At program point L813(line 813) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L813-1(line 813) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L805(line 805) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 543) no Hoare annotation was computed. [2022-07-13 19:22:02,832 INFO L902 garLoopResultBuilder]: At program point L541-2(lines 540 545) the Hoare annotation is: true [2022-07-13 19:22:02,832 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 794) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L789-1(lines 789 794) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L895 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L814-1(line 814) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L895 garLoopResultBuilder]: At program point L798(line 798) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L542(line 542) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L798-1(line 798) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L895 garLoopResultBuilder]: At program point L815(line 815) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L815-1(line 815) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L895 garLoopResultBuilder]: At program point L807(line 807) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L807-1(line 807) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L895 garLoopResultBuilder]: At program point L816(line 816) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L816-1(line 816) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L895 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L808-1(line 808) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L895 garLoopResultBuilder]: At program point L792(line 792) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_error~0 0) (= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0) (= 0 (select ~__CS_thread~0.base 2)) (= |#funAddr~main_thread.offset| (select ~__CS_thread~0.offset 0)) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L792-1(line 792) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L895 garLoopResultBuilder]: At program point L809(line 809) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L809-1(line 809) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L801(lines 801 806) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 19:22:02,833 INFO L899 garLoopResultBuilder]: For program point L801-1(lines 801 806) no Hoare annotation was computed. [2022-07-13 19:22:02,834 INFO L899 garLoopResultBuilder]: For program point L768-2(lines 768 771) no Hoare annotation was computed. [2022-07-13 19:22:02,834 INFO L895 garLoopResultBuilder]: At program point L768-3(lines 768 771) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (= 0 (select ~__CS_thread~0.base 2)) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-13 19:22:02,834 INFO L899 garLoopResultBuilder]: For program point L793(line 793) no Hoare annotation was computed. [2022-07-13 19:22:02,834 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-13 19:22:02,834 INFO L899 garLoopResultBuilder]: For program point L810-1(line 810) no Hoare annotation was computed. [2022-07-13 19:22:02,834 INFO L895 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-13 19:22:02,834 INFO L899 garLoopResultBuilder]: For program point L811-1(line 811) no Hoare annotation was computed. [2022-07-13 19:22:02,834 INFO L899 garLoopResultBuilder]: For program point __CS_csEXIT(lines 562 568) no Hoare annotation was computed. [2022-07-13 19:22:02,834 INFO L895 garLoopResultBuilder]: At program point __CS_csENTRY(lines 562 568) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))) [2022-07-13 19:22:02,834 INFO L899 garLoopResultBuilder]: For program point __CS_csFINAL(lines 562 568) no Hoare annotation was computed. [2022-07-13 19:22:02,834 INFO L899 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-07-13 19:22:02,834 INFO L895 garLoopResultBuilder]: At program point L565(line 565) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))) [2022-07-13 19:22:02,834 INFO L899 garLoopResultBuilder]: For program point L567-2(line 567) no Hoare annotation was computed. [2022-07-13 19:22:02,834 INFO L899 garLoopResultBuilder]: For program point L565-1(line 565) no Hoare annotation was computed. [2022-07-13 19:22:02,841 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 19:22:02,843 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 19:22:02,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-13 19:22:02,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-13 19:22:02,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 07:22:02 BoogieIcfgContainer [2022-07-13 19:22:02,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 19:22:02,864 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 19:22:02,864 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 19:22:02,864 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 19:22:02,865 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:16" (3/4) ... [2022-07-13 19:22:02,866 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 19:22:02,870 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2022-07-13 19:22:02,870 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2022-07-13 19:22:02,870 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:22:02,870 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2022-07-13 19:22:02,870 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2022-07-13 19:22:02,871 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-13 19:22:02,871 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2022-07-13 19:22:02,871 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_init [2022-07-13 19:22:02,878 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-07-13 19:22:02,879 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-07-13 19:22:02,880 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-13 19:22:02,880 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-13 19:22:02,896 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) && #funAddr~thread2.offset == #fp) && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) [2022-07-13 19:22:02,896 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(__CS_ret_PREEMPTED == 1) || !(\old(__CS_ret) % 256 == 0)) || (\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) [2022-07-13 19:22:02,897 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((__CS_ret % 256 == 0 && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) [2022-07-13 19:22:02,898 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) [2022-07-13 19:22:02,938 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 19:22:02,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 19:22:02,938 INFO L158 Benchmark]: Toolchain (without parser) took 49398.44ms. Allocated memory was 96.5MB in the beginning and 501.2MB in the end (delta: 404.8MB). Free memory was 57.1MB in the beginning and 213.4MB in the end (delta: -156.3MB). Peak memory consumption was 248.6MB. Max. memory is 16.1GB. [2022-07-13 19:22:02,938 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 19:22:02,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.87ms. Allocated memory is still 96.5MB. Free memory was 56.9MB in the beginning and 59.2MB in the end (delta: -2.2MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2022-07-13 19:22:02,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.82ms. Allocated memory is still 96.5MB. Free memory was 59.2MB in the beginning and 54.9MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 19:22:02,939 INFO L158 Benchmark]: Boogie Preprocessor took 70.86ms. Allocated memory is still 96.5MB. Free memory was 54.9MB in the beginning and 51.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 19:22:02,939 INFO L158 Benchmark]: RCFGBuilder took 2119.18ms. Allocated memory is still 96.5MB. Free memory was 51.2MB in the beginning and 63.6MB in the end (delta: -12.4MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2022-07-13 19:22:02,939 INFO L158 Benchmark]: TraceAbstraction took 46503.62ms. Allocated memory was 96.5MB in the beginning and 501.2MB in the end (delta: 404.8MB). Free memory was 63.0MB in the beginning and 224.9MB in the end (delta: -161.9MB). Peak memory consumption was 356.7MB. Max. memory is 16.1GB. [2022-07-13 19:22:02,940 INFO L158 Benchmark]: Witness Printer took 73.87ms. Allocated memory is still 501.2MB. Free memory was 224.9MB in the beginning and 213.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 19:22:02,941 INFO L339 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 96.5MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.87ms. Allocated memory is still 96.5MB. Free memory was 56.9MB in the beginning and 59.2MB in the end (delta: -2.2MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.82ms. Allocated memory is still 96.5MB. Free memory was 59.2MB in the beginning and 54.9MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.86ms. Allocated memory is still 96.5MB. Free memory was 54.9MB in the beginning and 51.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2119.18ms. Allocated memory is still 96.5MB. Free memory was 51.2MB in the beginning and 63.6MB in the end (delta: -12.4MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * TraceAbstraction took 46503.62ms. Allocated memory was 96.5MB in the beginning and 501.2MB in the end (delta: 404.8MB). Free memory was 63.0MB in the beginning and 224.9MB in the end (delta: -161.9MB). Peak memory consumption was 356.7MB. Max. memory is 16.1GB. * Witness Printer took 73.87ms. Allocated memory is still 501.2MB. Free memory was 224.9MB in the beginning and 213.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset * 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 - PositiveResult [Line: 542]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 175 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.4s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 2716 SdHoareTripleChecker+Valid, 11.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2676 mSDsluCounter, 7244 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4478 mSDsCounter, 2413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4674 IncrementalHoareTripleChecker+Invalid, 7091 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2413 mSolverCounterUnsat, 2766 mSDtfsCounter, 4674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2065 GetRequests, 1961 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 58 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 69 LocationsWithAnnotation, 3660 PreInvPairs, 5194 NumberOfFragments, 1920 HoareAnnotationTreeSize, 3660 FomulaSimplifications, 8468 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 69 FomulaSimplificationsInter, 27766 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 20.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2291 NumberOfCodeBlocks, 2087 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2874 ConstructedInterpolants, 0 QuantifiedInterpolants, 5735 SizeOfPredicates, 16 NumberOfNonLiveVariables, 14366 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 7782/7959 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 689]: Loop Invariant [2022-07-13 19:22:02,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || !(\old(__CS_ret) % 256 == 0)) || (\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) - InvariantResult [Line: 768]: Loop Invariant [2022-07-13 19:22:02,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset Derived loop invariant: ((((__CS_ret % 256 == 0 && __CS_ret_PREEMPTED == 1) && __CS_error == 0) && i <= 1) && 0 == __CS_thread[2]) && __CS_thread[2] == 0 - InvariantResult [Line: 763]: Loop Invariant [2022-07-13 19:22:02,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset Derived loop invariant: (((__CS_ret % 256 == 0 && __CS_ret_PREEMPTED == 1) && __CS_error == 0) && 0 == __CS_thread[2]) && __CS_thread[2] == 0 - InvariantResult [Line: 705]: Loop Invariant [2022-07-13 19:22:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-13 19:22:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:22:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-13 19:22:02,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset Derived loop invariant: ((((\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) && #funAddr~thread2.offset == #fp) && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 743]: Loop Invariant Derived loop invariant: ((__CS_ret % 256 == 0 && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-13 19:22:02,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE