./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 ae007674 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-dev-ae00767 [2021-12-28 01:39:54,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 01:39:54,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 01:39:54,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 01:39:54,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 01:39:54,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 01:39:54,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 01:39:54,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 01:39:54,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 01:39:54,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 01:39:54,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 01:39:54,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 01:39:54,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 01:39:54,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 01:39:54,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 01:39:54,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 01:39:54,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 01:39:54,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 01:39:54,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 01:39:54,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 01:39:54,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 01:39:54,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 01:39:54,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 01:39:54,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 01:39:54,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 01:39:54,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 01:39:54,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 01:39:54,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 01:39:54,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 01:39:54,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 01:39:54,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 01:39:54,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 01:39:54,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 01:39:54,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 01:39:54,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 01:39:54,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 01:39:54,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 01:39:54,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 01:39:54,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 01:39:54,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 01:39:54,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 01:39:54,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 01:39:54,566 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 01:39:54,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 01:39:54,573 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 01:39:54,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 01:39:54,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 01:39:54,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 01:39:54,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 01:39:54,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 01:39:54,577 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 01:39:54,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 01:39:54,577 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 01:39:54,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 01:39:54,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 01:39:54,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 01:39:54,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 01:39:54,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 01:39:54,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 01:39:54,578 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 01:39:54,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 01:39:54,579 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 01:39:54,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 01:39:54,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 01:39:54,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 01:39:54,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 01:39:54,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:39:54,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 01:39:54,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 01:39:54,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 01:39:54,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 01:39:54,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 01:39:54,588 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 01:39:54,588 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 01:39:54,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 01:39:54,588 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 [2021-12-28 01:39:54,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 01:39:54,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 01:39:54,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 01:39:54,917 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 01:39:54,917 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 01:39:54,918 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 [2021-12-28 01:39:54,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adae10cad/f92b069ba4a64cb488517b80e1b5c01e/FLAG2a12ea6dd [2021-12-28 01:39:55,469 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 01:39:55,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2021-12-28 01:39:55,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adae10cad/f92b069ba4a64cb488517b80e1b5c01e/FLAG2a12ea6dd [2021-12-28 01:39:55,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adae10cad/f92b069ba4a64cb488517b80e1b5c01e [2021-12-28 01:39:55,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 01:39:55,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 01:39:55,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 01:39:55,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 01:39:55,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 01:39:55,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:39:55" (1/1) ... [2021-12-28 01:39:55,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@754a7eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:55, skipping insertion in model container [2021-12-28 01:39:55,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:39:55" (1/1) ... [2021-12-28 01:39:55,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 01:39:55,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 01:39:56,143 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] [2021-12-28 01:39:56,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:39:56,258 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 01:39:56,296 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] [2021-12-28 01:39:56,349 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:39:56,391 INFO L208 MainTranslator]: Completed translation [2021-12-28 01:39:56,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56 WrapperNode [2021-12-28 01:39:56,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 01:39:56,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 01:39:56,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 01:39:56,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 01:39:56,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56" (1/1) ... [2021-12-28 01:39:56,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56" (1/1) ... [2021-12-28 01:39:56,489 INFO L137 Inliner]: procedures = 145, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 539 [2021-12-28 01:39:56,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 01:39:56,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 01:39:56,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 01:39:56,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 01:39:56,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56" (1/1) ... [2021-12-28 01:39:56,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56" (1/1) ... [2021-12-28 01:39:56,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56" (1/1) ... [2021-12-28 01:39:56,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56" (1/1) ... [2021-12-28 01:39:56,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56" (1/1) ... [2021-12-28 01:39:56,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56" (1/1) ... [2021-12-28 01:39:56,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56" (1/1) ... [2021-12-28 01:39:56,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 01:39:56,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 01:39:56,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 01:39:56,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 01:39:56,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56" (1/1) ... [2021-12-28 01:39:56,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:39:56,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:39:56,608 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) [2021-12-28 01:39:56,612 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 [2021-12-28 01:39:56,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 01:39:56,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 01:39:56,637 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-28 01:39:56,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-28 01:39:56,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 01:39:56,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 01:39:56,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 01:39:56,637 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2021-12-28 01:39:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2021-12-28 01:39:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2021-12-28 01:39:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2021-12-28 01:39:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2021-12-28 01:39:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2021-12-28 01:39:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 01:39:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2021-12-28 01:39:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2021-12-28 01:39:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2021-12-28 01:39:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2021-12-28 01:39:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 01:39:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 01:39:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2021-12-28 01:39:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2021-12-28 01:39:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 01:39:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2021-12-28 01:39:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2021-12-28 01:39:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 01:39:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 01:39:56,832 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 01:39:56,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 01:39:57,181 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2021-12-28 01:39:57,181 INFO L766 $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; [2021-12-28 01:39:57,182 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != ~__CS_ret~0 % 256); [2021-12-28 01:39:57,182 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2021-12-28 01:39:57,182 INFO L766 $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; [2021-12-28 01:39:57,182 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != ~__CS_ret~0 % 256); [2021-12-28 01:39:57,182 INFO L766 $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; [2021-12-28 01:39:58,561 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 01:39:58,569 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 01:39:58,570 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-28 01:39:58,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:39:58 BoogieIcfgContainer [2021-12-28 01:39:58,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 01:39:58,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 01:39:58,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 01:39:58,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 01:39:58,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:39:55" (1/3) ... [2021-12-28 01:39:58,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e391750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:39:58, skipping insertion in model container [2021-12-28 01:39:58,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:39:56" (2/3) ... [2021-12-28 01:39:58,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e391750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:39:58, skipping insertion in model container [2021-12-28 01:39:58,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:39:58" (3/3) ... [2021-12-28 01:39:58,579 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2021-12-28 01:39:58,583 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 01:39:58,583 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 01:39:58,627 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 01:39:58,632 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 01:39:58,632 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 01:39:58,652 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) [2021-12-28 01:39:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-28 01:39:58,663 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:39:58,664 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:39:58,664 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:39:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:39:58,668 INFO L85 PathProgramCache]: Analyzing trace with hash 246520095, now seen corresponding path program 1 times [2021-12-28 01:39:58,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:39:58,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004313979] [2021-12-28 01:39:58,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:39:58,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:39:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:58,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:39:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 01:39:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 01:39:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-28 01:39:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 01:39:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 01:39:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:39:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 01:39:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 01:39:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:39:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-28 01:39:59,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:39:59,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004313979] [2021-12-28 01:39:59,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004313979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:39:59,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:39:59,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 01:39:59,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402924233] [2021-12-28 01:39:59,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:39:59,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-28 01:39:59,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:39:59,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-28 01:39:59,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 01:39:59,153 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) [2021-12-28 01:39:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:39:59,190 INFO L93 Difference]: Finished difference Result 348 states and 578 transitions. [2021-12-28 01:39:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 01:39:59,192 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 [2021-12-28 01:39:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:39:59,200 INFO L225 Difference]: With dead ends: 348 [2021-12-28 01:39:59,200 INFO L226 Difference]: Without dead ends: 171 [2021-12-28 01:39:59,205 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:39:59,208 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:39:59,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:39:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-28 01:39:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-12-28 01:39:59,250 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) [2021-12-28 01:39:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2021-12-28 01:39:59,254 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 72 [2021-12-28 01:39:59,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:39:59,254 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2021-12-28 01:39:59,255 INFO L471 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) [2021-12-28 01:39:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2021-12-28 01:39:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-28 01:39:59,259 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:39:59,259 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:39:59,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 01:39:59,260 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:39:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:39:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1330951645, now seen corresponding path program 1 times [2021-12-28 01:39:59,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:39:59,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646056748] [2021-12-28 01:39:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:39:59,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:39:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:39:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 01:39:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 01:39:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-28 01:39:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 01:39:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 01:39:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 01:39:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 01:39:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 01:39:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 01:39:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-28 01:39:59,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:39:59,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646056748] [2021-12-28 01:39:59,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646056748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:39:59,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:39:59,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 01:39:59,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177553459] [2021-12-28 01:39:59,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:39:59,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:39:59,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:39:59,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:39:59,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 01:39:59,597 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) [2021-12-28 01:39:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:39:59,668 INFO L93 Difference]: Finished difference Result 340 states and 520 transitions. [2021-12-28 01:39:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:39:59,670 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 [2021-12-28 01:39:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:39:59,672 INFO L225 Difference]: With dead ends: 340 [2021-12-28 01:39:59,672 INFO L226 Difference]: Without dead ends: 175 [2021-12-28 01:39:59,674 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:39:59,675 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:39:59,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 514 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:39:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-28 01:39:59,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2021-12-28 01:39:59,689 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) [2021-12-28 01:39:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2021-12-28 01:39:59,691 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 72 [2021-12-28 01:39:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:39:59,692 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2021-12-28 01:39:59,692 INFO L471 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) [2021-12-28 01:39:59,692 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2021-12-28 01:39:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-28 01:39:59,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:39:59,708 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:39:59,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 01:39:59,709 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:39:59,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:39:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1826847327, now seen corresponding path program 1 times [2021-12-28 01:39:59,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:39:59,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148728652] [2021-12-28 01:39:59,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:39:59,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:39:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 01:39:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 01:39:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 01:39:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 01:39:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:39:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:39:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 01:39:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 01:39:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 01:39:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 01:39:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:39:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-28 01:39:59,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:39:59,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148728652] [2021-12-28 01:39:59,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148728652] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:39:59,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:39:59,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 01:39:59,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564109575] [2021-12-28 01:39:59,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:39:59,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:39:59,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:39:59,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:39:59,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 01:39:59,971 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) [2021-12-28 01:40:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:40:00,006 INFO L93 Difference]: Finished difference Result 343 states and 524 transitions. [2021-12-28 01:40:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:40:00,007 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 [2021-12-28 01:40:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:40:00,009 INFO L225 Difference]: With dead ends: 343 [2021-12-28 01:40:00,009 INFO L226 Difference]: Without dead ends: 174 [2021-12-28 01:40:00,011 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:40:00,012 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:40:00,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 515 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:40:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-12-28 01:40:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2021-12-28 01:40:00,024 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) [2021-12-28 01:40:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2021-12-28 01:40:00,025 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 75 [2021-12-28 01:40:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:40:00,026 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2021-12-28 01:40:00,026 INFO L471 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) [2021-12-28 01:40:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2021-12-28 01:40:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-28 01:40:00,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:40:00,028 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:40:00,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 01:40:00,028 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:40:00,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:40:00,029 INFO L85 PathProgramCache]: Analyzing trace with hash -541531615, now seen corresponding path program 1 times [2021-12-28 01:40:00,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:40:00,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436091352] [2021-12-28 01:40:00,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:00,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:40:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-28 01:40:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 01:40:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 01:40:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 01:40:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-28 01:40:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-28 01:40:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 01:40:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-28 01:40:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-28 01:40:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-28 01:40:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-28 01:40:00,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:40:00,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436091352] [2021-12-28 01:40:00,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436091352] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:40:00,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587627517] [2021-12-28 01:40:00,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:00,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:00,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:40:00,217 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) [2021-12-28 01:40:00,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 01:40:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:00,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 01:40:00,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:40:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-28 01:40:01,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:40:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-28 01:40:01,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587627517] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:40:01,325 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:40:01,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-28 01:40:01,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403653657] [2021-12-28 01:40:01,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:40:01,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:40:01,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:40:01,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:40:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:40:01,333 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) [2021-12-28 01:40:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:40:01,387 INFO L93 Difference]: Finished difference Result 347 states and 529 transitions. [2021-12-28 01:40:01,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 01:40:01,388 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 [2021-12-28 01:40:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:40:01,390 INFO L225 Difference]: With dead ends: 347 [2021-12-28 01:40:01,390 INFO L226 Difference]: Without dead ends: 177 [2021-12-28 01:40:01,391 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:40:01,392 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:40:01,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 515 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:40:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-28 01:40:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-12-28 01:40:01,402 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) [2021-12-28 01:40:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2021-12-28 01:40:01,403 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 77 [2021-12-28 01:40:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:40:01,404 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2021-12-28 01:40:01,404 INFO L471 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) [2021-12-28 01:40:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2021-12-28 01:40:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-28 01:40:01,406 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:40:01,406 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:40:01,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 01:40:01,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:01,631 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:40:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:40:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1454696411, now seen corresponding path program 2 times [2021-12-28 01:40:01,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:40:01,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512401298] [2021-12-28 01:40:01,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:01,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:40:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:01,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 01:40:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 01:40:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:01,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 01:40:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 01:40:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:01,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 01:40:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 01:40:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:01,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 01:40:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:01,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 01:40:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:01,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 01:40:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:01,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 01:40:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2021-12-28 01:40:01,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:40:01,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512401298] [2021-12-28 01:40:01,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512401298] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:40:01,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386891024] [2021-12-28 01:40:01,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 01:40:01,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:01,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:40:01,862 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) [2021-12-28 01:40:01,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 01:40:02,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 01:40:02,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 01:40:02,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 01:40:02,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:40:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-28 01:40:02,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:40:02,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386891024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:40:02,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:40:02,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-12-28 01:40:02,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984407276] [2021-12-28 01:40:02,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:40:02,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:40:02,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:40:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:40:02,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:40:02,888 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) [2021-12-28 01:40:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:40:02,921 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2021-12-28 01:40:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:40:02,921 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 [2021-12-28 01:40:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:40:02,925 INFO L225 Difference]: With dead ends: 339 [2021-12-28 01:40:02,925 INFO L226 Difference]: Without dead ends: 313 [2021-12-28 01:40:02,926 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:40:02,926 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:40:02,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 1001 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:40:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-28 01:40:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 312. [2021-12-28 01:40:02,943 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) [2021-12-28 01:40:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 485 transitions. [2021-12-28 01:40:02,946 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 485 transitions. Word has length 81 [2021-12-28 01:40:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:40:02,946 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 485 transitions. [2021-12-28 01:40:02,946 INFO L471 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) [2021-12-28 01:40:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 485 transitions. [2021-12-28 01:40:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-28 01:40:02,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:40:02,950 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:40:02,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 01:40:03,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:03,176 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:40:03,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:40:03,176 INFO L85 PathProgramCache]: Analyzing trace with hash -613977023, now seen corresponding path program 1 times [2021-12-28 01:40:03,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:40:03,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312026495] [2021-12-28 01:40:03,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:03,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:40:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 01:40:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:40:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 01:40:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 01:40:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 01:40:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 01:40:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 01:40:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-28 01:40:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-28 01:40:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 01:40:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-28 01:40:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 01:40:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-28 01:40:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-28 01:40:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 01:40:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 01:40:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-28 01:40:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:03,501 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2021-12-28 01:40:03,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:40:03,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312026495] [2021-12-28 01:40:03,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312026495] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:40:03,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866431451] [2021-12-28 01:40:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:03,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:03,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:40:03,502 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) [2021-12-28 01:40:03,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 01:40:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:04,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 2132 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 01:40:04,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:40:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2021-12-28 01:40:04,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:40:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2021-12-28 01:40:04,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866431451] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:40:04,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:40:04,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2021-12-28 01:40:04,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175847480] [2021-12-28 01:40:04,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:40:04,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 01:40:04,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:40:04,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 01:40:04,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-28 01:40:04,917 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) [2021-12-28 01:40:06,980 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 [] [2021-12-28 01:40:08,996 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 [] [2021-12-28 01:40:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:40:09,445 INFO L93 Difference]: Finished difference Result 631 states and 988 transitions. [2021-12-28 01:40:09,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 01:40:09,446 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 [2021-12-28 01:40:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:40:09,448 INFO L225 Difference]: With dead ends: 631 [2021-12-28 01:40:09,448 INFO L226 Difference]: Without dead ends: 331 [2021-12-28 01:40:09,450 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:40:09,451 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 100 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 227 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.5s IncrementalHoareTripleChecker+Time [2021-12-28 01:40:09,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 611 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 314 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2021-12-28 01:40:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-12-28 01:40:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2021-12-28 01:40:09,484 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) [2021-12-28 01:40:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 503 transitions. [2021-12-28 01:40:09,488 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 503 transitions. Word has length 155 [2021-12-28 01:40:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:40:09,488 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 503 transitions. [2021-12-28 01:40:09,489 INFO L471 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) [2021-12-28 01:40:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 503 transitions. [2021-12-28 01:40:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-28 01:40:09,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:40:09,494 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:40:09,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 01:40:09,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:09,720 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:40:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:40:09,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1817944839, now seen corresponding path program 2 times [2021-12-28 01:40:09,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:40:09,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601609576] [2021-12-28 01:40:09,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:09,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:40:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 01:40:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:40:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 01:40:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 01:40:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 01:40:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 01:40:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 01:40:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 01:40:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 01:40:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-28 01:40:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 01:40:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-28 01:40:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-28 01:40:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-28 01:40:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-28 01:40:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-28 01:40:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-28 01:40:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2021-12-28 01:40:21,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:40:21,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601609576] [2021-12-28 01:40:21,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601609576] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:40:21,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281068629] [2021-12-28 01:40:21,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 01:40:21,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:21,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:40:21,752 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) [2021-12-28 01:40:21,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 01:40:22,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 01:40:22,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 01:40:22,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 01:40:22,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:40:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2021-12-28 01:40:23,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:40:23,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281068629] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:40:23,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:40:23,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2021-12-28 01:40:23,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800977321] [2021-12-28 01:40:23,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:40:23,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:40:23,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:40:23,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:40:23,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-12-28 01:40:23,021 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) [2021-12-28 01:40:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:40:23,045 INFO L93 Difference]: Finished difference Result 619 states and 965 transitions. [2021-12-28 01:40:23,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:40:23,046 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 [2021-12-28 01:40:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:40:23,049 INFO L225 Difference]: With dead ends: 619 [2021-12-28 01:40:23,049 INFO L226 Difference]: Without dead ends: 325 [2021-12-28 01:40:23,050 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:40:23,052 INFO L933 BasicCegarLoop]: 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 [2021-12-28 01:40:23,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:40:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-12-28 01:40:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-12-28 01:40:23,068 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) [2021-12-28 01:40:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 502 transitions. [2021-12-28 01:40:23,071 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 502 transitions. Word has length 164 [2021-12-28 01:40:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:40:23,071 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 502 transitions. [2021-12-28 01:40:23,071 INFO L471 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) [2021-12-28 01:40:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 502 transitions. [2021-12-28 01:40:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-12-28 01:40:23,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:40:23,075 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:40:23,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 01:40:23,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:23,299 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:40:23,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:40:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 755632713, now seen corresponding path program 1 times [2021-12-28 01:40:23,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:40:23,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425990673] [2021-12-28 01:40:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:23,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:40:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:40:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:40:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 01:40:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:40:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 01:40:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 01:40:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 01:40:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 01:40:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 01:40:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-28 01:40:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-28 01:40:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-28 01:40:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-28 01:40:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-28 01:40:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-28 01:40:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-28 01:40:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-28 01:40:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-28 01:40:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-28 01:40:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2021-12-28 01:40:23,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:40:23,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425990673] [2021-12-28 01:40:23,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425990673] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:40:23,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591616553] [2021-12-28 01:40:23,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:23,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:23,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:40:23,752 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) [2021-12-28 01:40:23,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 01:40:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:24,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 2467 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 01:40:24,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:40:24,853 INFO L387 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 [2021-12-28 01:40:24,903 INFO L387 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 [2021-12-28 01:40:25,072 INFO L387 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 [2021-12-28 01:40:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2021-12-28 01:40:25,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:40:25,305 INFO L387 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 [2021-12-28 01:40:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2021-12-28 01:40:25,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591616553] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:40:25,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:40:25,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-12-28 01:40:25,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256731826] [2021-12-28 01:40:25,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:40:25,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 01:40:25,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:40:25,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 01:40:25,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-12-28 01:40:25,589 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) [2021-12-28 01:40:27,627 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 [] [2021-12-28 01:40:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:40:29,586 INFO L93 Difference]: Finished difference Result 747 states and 1193 transitions. [2021-12-28 01:40:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-28 01:40:29,587 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 [2021-12-28 01:40:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:40:29,596 INFO L225 Difference]: With dead ends: 747 [2021-12-28 01:40:29,597 INFO L226 Difference]: Without dead ends: 717 [2021-12-28 01:40:29,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2021-12-28 01:40:29,600 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 1061 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 1040 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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.7s IncrementalHoareTripleChecker+Time [2021-12-28 01:40:29,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1073 Valid, 1136 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 1566 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2021-12-28 01:40:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-12-28 01:40:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 680. [2021-12-28 01:40:29,657 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) [2021-12-28 01:40:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1086 transitions. [2021-12-28 01:40:29,663 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1086 transitions. Word has length 186 [2021-12-28 01:40:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:40:29,665 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 1086 transitions. [2021-12-28 01:40:29,665 INFO L471 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) [2021-12-28 01:40:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1086 transitions. [2021-12-28 01:40:29,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-12-28 01:40:29,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:40:29,671 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:40:29,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 01:40:29,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:29,888 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:40:29,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:40:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash 998047407, now seen corresponding path program 1 times [2021-12-28 01:40:29,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:40:29,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303277906] [2021-12-28 01:40:29,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:29,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:40:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:40:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:40:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 01:40:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:40:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 01:40:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 01:40:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 01:40:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 01:40:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 01:40:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-28 01:40:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-28 01:40:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-28 01:40:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-28 01:40:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-28 01:40:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-28 01:40:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-28 01:40:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-28 01:40:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-28 01:40:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-12-28 01:40:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2021-12-28 01:40:30,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:40:30,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303277906] [2021-12-28 01:40:30,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303277906] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:40:30,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845525879] [2021-12-28 01:40:30,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:30,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:30,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:40:30,351 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) [2021-12-28 01:40:30,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 01:40:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:31,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 2436 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 01:40:31,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:40:31,391 INFO L387 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 [2021-12-28 01:40:31,405 INFO L387 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 [2021-12-28 01:40:31,441 INFO L387 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 [2021-12-28 01:40:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2021-12-28 01:40:31,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:40:31,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845525879] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:40:31,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:40:31,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2021-12-28 01:40:31,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466074784] [2021-12-28 01:40:31,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:40:31,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 01:40:31,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:40:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 01:40:31,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-28 01:40:31,629 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) [2021-12-28 01:40:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:40:31,764 INFO L93 Difference]: Finished difference Result 1342 states and 2141 transitions. [2021-12-28 01:40:31,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 01:40:31,765 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 [2021-12-28 01:40:31,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:40:31,771 INFO L225 Difference]: With dead ends: 1342 [2021-12-28 01:40:31,772 INFO L226 Difference]: Without dead ends: 696 [2021-12-28 01:40:31,778 INFO L932 BasicCegarLoop]: 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 [2021-12-28 01:40:31,781 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 272 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2021-12-28 01:40:31,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 904 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:40:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-12-28 01:40:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 686. [2021-12-28 01:40:31,825 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) [2021-12-28 01:40:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1093 transitions. [2021-12-28 01:40:31,830 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1093 transitions. Word has length 187 [2021-12-28 01:40:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:40:31,831 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 1093 transitions. [2021-12-28 01:40:31,831 INFO L471 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) [2021-12-28 01:40:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1093 transitions. [2021-12-28 01:40:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-12-28 01:40:31,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:40:31,835 INFO L514 BasicCegarLoop]: 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] [2021-12-28 01:40:31,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 01:40:32,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:32,044 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:40:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:40:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1865108637, now seen corresponding path program 1 times [2021-12-28 01:40:32,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:40:32,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987752712] [2021-12-28 01:40:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:32,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:40:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 01:40:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 01:40:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 01:40:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:40:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 01:40:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 01:40:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 01:40:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 01:40:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 01:40:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 01:40:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-28 01:40:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-28 01:40:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-28 01:40:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-28 01:40:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-28 01:40:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-28 01:40:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-28 01:40:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-28 01:40:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:40,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-28 01:40:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:40,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-28 01:40:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2021-12-28 01:40:40,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:40:40,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987752712] [2021-12-28 01:40:40,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987752712] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:40:40,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491002953] [2021-12-28 01:40:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:40:40,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:40,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:40:40,013 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) [2021-12-28 01:40:40,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 01:40:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:40:41,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 2464 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 01:40:41,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:40:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 72 proven. 126 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2021-12-28 01:40:41,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 01:40:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2021-12-28 01:40:42,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491002953] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 01:40:42,064 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 01:40:42,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 22 [2021-12-28 01:40:42,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777408078] [2021-12-28 01:40:42,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 01:40:42,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-28 01:40:42,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:40:42,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-28 01:40:42,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2021-12-28 01:40:42,070 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) [2021-12-28 01:40:44,112 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 [] [2021-12-28 01:40:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:40:46,738 INFO L93 Difference]: Finished difference Result 1956 states and 3237 transitions. [2021-12-28 01:40:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-28 01:40:46,739 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 [2021-12-28 01:40:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:40:46,739 INFO L225 Difference]: With dead ends: 1956 [2021-12-28 01:40:46,739 INFO L226 Difference]: Without dead ends: 0 [2021-12-28 01:40:46,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2021-12-28 01:40:46,750 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 1027 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 1123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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, 4.2s IncrementalHoareTripleChecker+Time [2021-12-28 01:40:46,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1043 Valid, 1267 Invalid, 3853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 2729 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2021-12-28 01:40:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-28 01:40:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-28 01:40:46,752 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) [2021-12-28 01:40:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-28 01:40:46,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2021-12-28 01:40:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:40:46,753 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 01:40:46,753 INFO L471 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) [2021-12-28 01:40:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-28 01:40:46,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-28 01:40:46,756 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 01:40:46,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-28 01:40:46,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:40:46,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-28 01:40:51,476 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2021-12-28 01:40:51,476 INFO L858 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-12-28 01:40:51,476 INFO L858 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2021-12-28 01:40:51,476 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2021-12-28 01:40:51,476 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_initEXIT(lines 569 572) no Hoare annotation was computed. [2021-12-28 01:40:51,476 INFO L861 garLoopResultBuilder]: At program point __CS_pthread_mutex_initENTRY(lines 569 572) the Hoare annotation is: true [2021-12-28 01:40:51,476 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_initFINAL(lines 569 572) no Hoare annotation was computed. [2021-12-28 01:40:51,476 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_joinEXIT(lines 642 663) no Hoare annotation was computed. [2021-12-28 01:40:51,476 INFO L854 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))) [2021-12-28 01:40:51,476 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_joinFINAL(lines 642 663) no Hoare annotation was computed. [2021-12-28 01:40:51,477 INFO L854 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))) [2021-12-28 01:40:51,477 INFO L858 garLoopResultBuilder]: For program point L661-1(line 661) no Hoare annotation was computed. [2021-12-28 01:40:51,477 INFO L858 garLoopResultBuilder]: For program point L655(lines 655 660) no Hoare annotation was computed. [2021-12-28 01:40:51,477 INFO L858 garLoopResultBuilder]: For program point L650(line 650) no Hoare annotation was computed. [2021-12-28 01:40:51,477 INFO L858 garLoopResultBuilder]: For program point L650-2(lines 650 654) no Hoare annotation was computed. [2021-12-28 01:40:51,477 INFO L858 garLoopResultBuilder]: For program point L644(lines 644 649) no Hoare annotation was computed. [2021-12-28 01:40:51,477 INFO L854 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))) [2021-12-28 01:40:51,477 INFO L858 garLoopResultBuilder]: For program point L584(lines 584 585) no Hoare annotation was computed. [2021-12-28 01:40:51,478 INFO L858 garLoopResultBuilder]: For program point L584-1(lines 584 585) no Hoare annotation was computed. [2021-12-28 01:40:51,478 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockEXIT(lines 582 587) no Hoare annotation was computed. [2021-12-28 01:40:51,478 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockFINAL(lines 582 587) no Hoare annotation was computed. [2021-12-28 01:40:51,478 INFO L854 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))) [2021-12-28 01:40:51,478 INFO L858 garLoopResultBuilder]: For program point L729-1(lines 722 753) no Hoare annotation was computed. [2021-12-28 01:40:51,478 INFO L854 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))) [2021-12-28 01:40:51,478 INFO L858 garLoopResultBuilder]: For program point L696-1(line 696) no Hoare annotation was computed. [2021-12-28 01:40:51,479 INFO L854 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))) [2021-12-28 01:40:51,479 INFO L858 garLoopResultBuilder]: For program point L713-1(lines 706 720) no Hoare annotation was computed. [2021-12-28 01:40:51,479 INFO L854 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)|))) [2021-12-28 01:40:51,479 INFO L858 garLoopResultBuilder]: For program point L697-1(lines 690 704) no Hoare annotation was computed. [2021-12-28 01:40:51,479 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$FINAL(line -1) no Hoare annotation was computed. [2021-12-28 01:40:51,479 INFO L854 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))) [2021-12-28 01:40:51,479 INFO L854 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))) [2021-12-28 01:40:51,480 INFO L858 garLoopResultBuilder]: For program point L714-1(line 714) no Hoare annotation was computed. [2021-12-28 01:40:51,480 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$EXIT(line -1) no Hoare annotation was computed. [2021-12-28 01:40:51,480 INFO L854 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))) [2021-12-28 01:40:51,480 INFO L858 garLoopResultBuilder]: For program point L731-1(lines 722 753) no Hoare annotation was computed. [2021-12-28 01:40:51,480 INFO L854 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))) [2021-12-28 01:40:51,480 INFO L858 garLoopResultBuilder]: For program point L698-1(line 698) no Hoare annotation was computed. [2021-12-28 01:40:51,480 INFO L854 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))))) [2021-12-28 01:40:51,481 INFO L858 garLoopResultBuilder]: For program point L715-1(lines 706 720) no Hoare annotation was computed. [2021-12-28 01:40:51,481 INFO L854 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)))) [2021-12-28 01:40:51,481 INFO L858 garLoopResultBuilder]: For program point L699-1(lines 690 704) no Hoare annotation was computed. [2021-12-28 01:40:51,481 INFO L854 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))) [2021-12-28 01:40:51,481 INFO L858 garLoopResultBuilder]: For program point L733-1(lines 722 753) no Hoare annotation was computed. [2021-12-28 01:40:51,481 INFO L854 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))) [2021-12-28 01:40:51,481 INFO L858 garLoopResultBuilder]: For program point L717-1(lines 706 720) no Hoare annotation was computed. [2021-12-28 01:40:51,482 INFO L854 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))) [2021-12-28 01:40:51,482 INFO L858 garLoopResultBuilder]: For program point L734-1(line 734) no Hoare annotation was computed. [2021-12-28 01:40:51,482 INFO L854 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))) [2021-12-28 01:40:51,482 INFO L858 garLoopResultBuilder]: For program point L701-1(lines 690 704) no Hoare annotation was computed. [2021-12-28 01:40:51,482 INFO L854 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))) [2021-12-28 01:40:51,482 INFO L858 garLoopResultBuilder]: For program point L718-1(line 718) no Hoare annotation was computed. [2021-12-28 01:40:51,482 INFO L854 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))) [2021-12-28 01:40:51,483 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 722 753) no Hoare annotation was computed. [2021-12-28 01:40:51,483 INFO L854 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))) [2021-12-28 01:40:51,483 INFO L858 garLoopResultBuilder]: For program point L702-1(line 702) no Hoare annotation was computed. [2021-12-28 01:40:51,483 INFO L858 garLoopResultBuilder]: For program point L752(lines 722 753) no Hoare annotation was computed. [2021-12-28 01:40:51,483 INFO L854 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))) [2021-12-28 01:40:51,483 INFO L858 garLoopResultBuilder]: For program point L719-1(lines 706 720) no Hoare annotation was computed. [2021-12-28 01:40:51,483 INFO L854 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))) [2021-12-28 01:40:51,484 INFO L858 garLoopResultBuilder]: For program point L736-1(line 736) no Hoare annotation was computed. [2021-12-28 01:40:51,484 INFO L854 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)|))) [2021-12-28 01:40:51,484 INFO L858 garLoopResultBuilder]: For program point L703-1(lines 690 704) no Hoare annotation was computed. [2021-12-28 01:40:51,484 INFO L854 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))) [2021-12-28 01:40:51,484 INFO L858 garLoopResultBuilder]: For program point L737-1(lines 722 753) no Hoare annotation was computed. [2021-12-28 01:40:51,484 INFO L854 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))) [2021-12-28 01:40:51,484 INFO L854 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))) [2021-12-28 01:40:51,485 INFO L858 garLoopResultBuilder]: For program point L738-1(line 738) no Hoare annotation was computed. [2021-12-28 01:40:51,485 INFO L854 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))) [2021-12-28 01:40:51,485 INFO L854 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)|))) [2021-12-28 01:40:51,485 INFO L854 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))) [2021-12-28 01:40:51,485 INFO L854 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))) [2021-12-28 01:40:51,485 INFO L858 garLoopResultBuilder]: For program point L739-1(lines 722 753) no Hoare annotation was computed. [2021-12-28 01:40:51,485 INFO L854 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))) [2021-12-28 01:40:51,486 INFO L858 garLoopResultBuilder]: For program point L740-1(line 740) no Hoare annotation was computed. [2021-12-28 01:40:51,486 INFO L854 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))) [2021-12-28 01:40:51,486 INFO L858 garLoopResultBuilder]: For program point L707-1(lines 706 720) no Hoare annotation was computed. [2021-12-28 01:40:51,486 INFO L854 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))) [2021-12-28 01:40:51,486 INFO L858 garLoopResultBuilder]: For program point L691-1(lines 690 704) no Hoare annotation was computed. [2021-12-28 01:40:51,486 INFO L854 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))) [2021-12-28 01:40:51,486 INFO L858 garLoopResultBuilder]: For program point L741-1(lines 722 753) no Hoare annotation was computed. [2021-12-28 01:40:51,487 INFO L854 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))) [2021-12-28 01:40:51,487 INFO L858 garLoopResultBuilder]: For program point L708-1(line 708) no Hoare annotation was computed. [2021-12-28 01:40:51,487 INFO L854 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))) [2021-12-28 01:40:51,487 INFO L858 garLoopResultBuilder]: For program point L725-1(lines 722 753) no Hoare annotation was computed. [2021-12-28 01:40:51,487 INFO L854 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))) [2021-12-28 01:40:51,487 INFO L858 garLoopResultBuilder]: For program point L692-1(line 692) no Hoare annotation was computed. [2021-12-28 01:40:51,487 INFO L858 garLoopResultBuilder]: For program point L742(line 742) no Hoare annotation was computed. [2021-12-28 01:40:51,488 INFO L854 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))))))) [2021-12-28 01:40:51,488 INFO L858 garLoopResultBuilder]: For program point L742-2(lines 742 751) no Hoare annotation was computed. [2021-12-28 01:40:51,488 INFO L858 garLoopResultBuilder]: For program point L709-1(lines 706 720) no Hoare annotation was computed. [2021-12-28 01:40:51,488 INFO L854 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))) [2021-12-28 01:40:51,488 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-28 01:40:51,488 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-12-28 01:40:51,488 INFO L858 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2021-12-28 01:40:51,488 INFO L854 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))) [2021-12-28 01:40:51,488 INFO L858 garLoopResultBuilder]: For program point L726-1(line 726) no Hoare annotation was computed. [2021-12-28 01:40:51,488 INFO L854 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)))) [2021-12-28 01:40:51,488 INFO L858 garLoopResultBuilder]: For program point L693-1(lines 690 704) no Hoare annotation was computed. [2021-12-28 01:40:51,488 INFO L854 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))) [2021-12-28 01:40:51,488 INFO L858 garLoopResultBuilder]: For program point L727-1(lines 722 753) no Hoare annotation was computed. [2021-12-28 01:40:51,488 INFO L854 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))) [2021-12-28 01:40:51,488 INFO L858 garLoopResultBuilder]: For program point L744-1(lines 743 751) no Hoare annotation was computed. [2021-12-28 01:40:51,488 INFO L854 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))) [2021-12-28 01:40:51,488 INFO L858 garLoopResultBuilder]: For program point L711-1(lines 706 720) no Hoare annotation was computed. [2021-12-28 01:40:51,489 INFO L854 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))) [2021-12-28 01:40:51,489 INFO L858 garLoopResultBuilder]: For program point L728-1(line 728) no Hoare annotation was computed. [2021-12-28 01:40:51,489 INFO L854 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))) [2021-12-28 01:40:51,489 INFO L858 garLoopResultBuilder]: For program point L695-1(lines 690 704) no Hoare annotation was computed. [2021-12-28 01:40:51,489 INFO L854 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))) [2021-12-28 01:40:51,489 INFO L858 garLoopResultBuilder]: For program point L712-1(line 712) no Hoare annotation was computed. [2021-12-28 01:40:51,489 INFO L854 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))) [2021-12-28 01:40:51,489 INFO L858 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-12-28 01:40:51,489 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockFINAL(lines 588 596) no Hoare annotation was computed. [2021-12-28 01:40:51,489 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockEXIT(lines 588 596) no Hoare annotation was computed. [2021-12-28 01:40:51,489 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_createFINAL(lines 664 677) no Hoare annotation was computed. [2021-12-28 01:40:51,490 INFO L858 garLoopResultBuilder]: For program point L666(lines 666 669) no Hoare annotation was computed. [2021-12-28 01:40:51,490 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_createEXIT(lines 664 677) no Hoare annotation was computed. [2021-12-28 01:40:51,490 INFO L854 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))) [2021-12-28 01:40:51,490 INFO L858 garLoopResultBuilder]: For program point L795(lines 795 800) no Hoare annotation was computed. [2021-12-28 01:40:51,490 INFO L858 garLoopResultBuilder]: For program point L795-1(lines 795 800) no Hoare annotation was computed. [2021-12-28 01:40:51,490 INFO L858 garLoopResultBuilder]: For program point L754(lines 754 818) no Hoare annotation was computed. [2021-12-28 01:40:51,490 INFO L854 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-28 01:40:51,490 INFO L858 garLoopResultBuilder]: For program point L812-1(line 812) no Hoare annotation was computed. [2021-12-28 01:40:51,491 INFO L854 garLoopResultBuilder]: At program point L804(line 804) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2021-12-28 01:40:51,491 INFO L858 garLoopResultBuilder]: For program point L804-1(line 804) no Hoare annotation was computed. [2021-12-28 01:40:51,491 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-28 01:40:51,491 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-28 01:40:51,491 INFO L858 garLoopResultBuilder]: For program point L763-2(lines 763 772) no Hoare annotation was computed. [2021-12-28 01:40:51,491 INFO L854 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)) [2021-12-28 01:40:51,491 INFO L858 garLoopResultBuilder]: For program point L763-4(lines 763 772) no Hoare annotation was computed. [2021-12-28 01:40:51,492 INFO L854 garLoopResultBuilder]: At program point L813(line 813) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-28 01:40:51,492 INFO L858 garLoopResultBuilder]: For program point L813-1(line 813) no Hoare annotation was computed. [2021-12-28 01:40:51,492 INFO L858 garLoopResultBuilder]: For program point L805(line 805) no Hoare annotation was computed. [2021-12-28 01:40:51,492 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 543) no Hoare annotation was computed. [2021-12-28 01:40:51,492 INFO L861 garLoopResultBuilder]: At program point L541-2(lines 540 545) the Hoare annotation is: true [2021-12-28 01:40:51,492 INFO L858 garLoopResultBuilder]: For program point L789(lines 789 794) no Hoare annotation was computed. [2021-12-28 01:40:51,492 INFO L858 garLoopResultBuilder]: For program point L789-1(lines 789 794) no Hoare annotation was computed. [2021-12-28 01:40:51,492 INFO L854 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-28 01:40:51,493 INFO L858 garLoopResultBuilder]: For program point L814-1(line 814) no Hoare annotation was computed. [2021-12-28 01:40:51,493 INFO L854 garLoopResultBuilder]: At program point L798(line 798) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2021-12-28 01:40:51,493 INFO L858 garLoopResultBuilder]: For program point L542(line 542) no Hoare annotation was computed. [2021-12-28 01:40:51,493 INFO L858 garLoopResultBuilder]: For program point L798-1(line 798) no Hoare annotation was computed. [2021-12-28 01:40:51,493 INFO L854 garLoopResultBuilder]: At program point L815(line 815) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-28 01:40:51,493 INFO L858 garLoopResultBuilder]: For program point L815-1(line 815) no Hoare annotation was computed. [2021-12-28 01:40:51,493 INFO L854 garLoopResultBuilder]: At program point L807(line 807) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-28 01:40:51,493 INFO L858 garLoopResultBuilder]: For program point L807-1(line 807) no Hoare annotation was computed. [2021-12-28 01:40:51,494 INFO L858 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2021-12-28 01:40:51,494 INFO L854 garLoopResultBuilder]: At program point L816(line 816) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-28 01:40:51,494 INFO L858 garLoopResultBuilder]: For program point L816-1(line 816) no Hoare annotation was computed. [2021-12-28 01:40:51,494 INFO L854 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-28 01:40:51,494 INFO L858 garLoopResultBuilder]: For program point L808-1(line 808) no Hoare annotation was computed. [2021-12-28 01:40:51,494 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-28 01:40:51,494 INFO L854 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)) [2021-12-28 01:40:51,495 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2021-12-28 01:40:51,495 INFO L858 garLoopResultBuilder]: For program point L792-1(line 792) no Hoare annotation was computed. [2021-12-28 01:40:51,495 INFO L854 garLoopResultBuilder]: At program point L809(line 809) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-28 01:40:51,495 INFO L858 garLoopResultBuilder]: For program point L809-1(line 809) no Hoare annotation was computed. [2021-12-28 01:40:51,495 INFO L858 garLoopResultBuilder]: For program point L801(lines 801 806) no Hoare annotation was computed. [2021-12-28 01:40:51,495 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-28 01:40:51,495 INFO L858 garLoopResultBuilder]: For program point L801-1(lines 801 806) no Hoare annotation was computed. [2021-12-28 01:40:51,495 INFO L858 garLoopResultBuilder]: For program point L768-2(lines 768 771) no Hoare annotation was computed. [2021-12-28 01:40:51,496 INFO L854 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)) [2021-12-28 01:40:51,496 INFO L858 garLoopResultBuilder]: For program point L793(line 793) no Hoare annotation was computed. [2021-12-28 01:40:51,496 INFO L854 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-28 01:40:51,496 INFO L858 garLoopResultBuilder]: For program point L810-1(line 810) no Hoare annotation was computed. [2021-12-28 01:40:51,496 INFO L854 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-28 01:40:51,496 INFO L858 garLoopResultBuilder]: For program point L811-1(line 811) no Hoare annotation was computed. [2021-12-28 01:40:51,496 INFO L858 garLoopResultBuilder]: For program point __CS_csEXIT(lines 562 568) no Hoare annotation was computed. [2021-12-28 01:40:51,496 INFO L854 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))) [2021-12-28 01:40:51,497 INFO L858 garLoopResultBuilder]: For program point __CS_csFINAL(lines 562 568) no Hoare annotation was computed. [2021-12-28 01:40:51,497 INFO L858 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2021-12-28 01:40:51,497 INFO L854 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))) [2021-12-28 01:40:51,497 INFO L858 garLoopResultBuilder]: For program point L567-2(line 567) no Hoare annotation was computed. [2021-12-28 01:40:51,497 INFO L858 garLoopResultBuilder]: For program point L565-1(line 565) no Hoare annotation was computed. [2021-12-28 01:40:51,500 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 01:40:51,501 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 01:40:51,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2021-12-28 01:40:51,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2021-12-28 01:40:51,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:40:51 BoogieIcfgContainer [2021-12-28 01:40:51,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 01:40:51,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 01:40:51,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 01:40:51,520 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 01:40:51,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:39:58" (3/4) ... [2021-12-28 01:40:51,524 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-28 01:40:51,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2021-12-28 01:40:51,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2021-12-28 01:40:51,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2021-12-28 01:40:51,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2021-12-28 01:40:51,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2021-12-28 01:40:51,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-28 01:40:51,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2021-12-28 01:40:51,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_init [2021-12-28 01:40:51,539 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2021-12-28 01:40:51,540 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2021-12-28 01:40:51,541 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-12-28 01:40:51,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-28 01:40:51,561 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) [2021-12-28 01:40:51,561 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)) [2021-12-28 01:40:51,564 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) [2021-12-28 01:40:51,564 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) [2021-12-28 01:40:51,610 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 01:40:51,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 01:40:51,611 INFO L158 Benchmark]: Toolchain (without parser) took 55825.70ms. Allocated memory was 50.3MB in the beginning and 469.8MB in the end (delta: 419.4MB). Free memory was 26.6MB in the beginning and 269.8MB in the end (delta: -243.2MB). Peak memory consumption was 175.2MB. Max. memory is 16.1GB. [2021-12-28 01:40:51,611 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 50.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:40:51,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.08ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 26.4MB in the beginning and 29.7MB in the end (delta: -3.4MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2021-12-28 01:40:51,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.21ms. Allocated memory is still 60.8MB. Free memory was 29.7MB in the beginning and 40.0MB in the end (delta: -10.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-28 01:40:51,612 INFO L158 Benchmark]: Boogie Preprocessor took 81.70ms. Allocated memory is still 60.8MB. Free memory was 40.0MB in the beginning and 36.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 01:40:51,612 INFO L158 Benchmark]: RCFGBuilder took 1993.96ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.4MB in the beginning and 43.5MB in the end (delta: -7.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2021-12-28 01:40:51,612 INFO L158 Benchmark]: TraceAbstraction took 52946.15ms. Allocated memory was 73.4MB in the beginning and 469.8MB in the end (delta: 396.4MB). Free memory was 43.0MB in the beginning and 282.4MB in the end (delta: -239.4MB). Peak memory consumption was 367.1MB. Max. memory is 16.1GB. [2021-12-28 01:40:51,612 INFO L158 Benchmark]: Witness Printer took 90.35ms. Allocated memory is still 469.8MB. Free memory was 282.4MB in the beginning and 269.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 01:40:51,614 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.16ms. Allocated memory is still 50.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.08ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 26.4MB in the beginning and 29.7MB in the end (delta: -3.4MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.21ms. Allocated memory is still 60.8MB. Free memory was 29.7MB in the beginning and 40.0MB in the end (delta: -10.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.70ms. Allocated memory is still 60.8MB. Free memory was 40.0MB in the beginning and 36.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1993.96ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.4MB in the beginning and 43.5MB in the end (delta: -7.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 52946.15ms. Allocated memory was 73.4MB in the beginning and 469.8MB in the end (delta: 396.4MB). Free memory was 43.0MB in the beginning and 282.4MB in the end (delta: -239.4MB). Peak memory consumption was 367.1MB. Max. memory is 16.1GB. * Witness Printer took 90.35ms. Allocated memory is still 469.8MB. Free memory was 282.4MB in the beginning and 269.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 52.9s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 2716 SdHoareTripleChecker+Valid, 12.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2676 mSDsluCounter, 7244 SdHoareTripleChecker+Invalid, 11.7s 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.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2065 GetRequests, 1960 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.3s 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 58 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 69 LocationsWithAnnotation, 3660 PreInvPairs, 5194 NumberOfFragments, 1920 HoareAnnotationTreeSize, 3660 FomulaSimplifications, 8468 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 69 FomulaSimplificationsInter, 27766 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 21.5s SatisfiabilityAnalysisTime, 5.6s 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 [2021-12-28 01:40:51,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,620 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 [2021-12-28 01:40:51,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,621 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 [2021-12-28 01:40:51,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,622 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 [2021-12-28 01:40:51,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2021-12-28 01:40:51,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-28 01:40:51,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-28 01:40:51,623 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! [2021-12-28 01:40:51,643 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