./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-1.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 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 19:20:56,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 19:20:56,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 19:20:56,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 19:20:56,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 19:20:56,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 19:20:56,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 19:20:56,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 19:20:56,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 19:20:56,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 19:20:56,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 19:20:56,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 19:20:56,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 19:20:56,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 19:20:56,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 19:20:56,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 19:20:56,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 19:20:56,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 19:20:56,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 19:20:56,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 19:20:56,817 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 19:20:56,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 19:20:56,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 19:20:56,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 19:20:56,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 19:20:56,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 19:20:56,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 19:20:56,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 19:20:56,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 19:20:56,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 19:20:56,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 19:20:56,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 19:20:56,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 19:20:56,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 19:20:56,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 19:20:56,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 19:20:56,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 19:20:56,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 19:20:56,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 19:20:56,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 19:20:56,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 19:20:56,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 19:20:56,835 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 19:20:56,858 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 19:20:56,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 19:20:56,859 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 19:20:56,859 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 19:20:56,860 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 19:20:56,860 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 19:20:56,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 19:20:56,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 19:20:56,861 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 19:20:56,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 19:20:56,862 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 19:20:56,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 19:20:56,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 19:20:56,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 19:20:56,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 19:20:56,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 19:20:56,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 19:20:56,863 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 19:20:56,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 19:20:56,863 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 19:20:56,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 19:20:56,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 19:20:56,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 19:20:56,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 19:20:56,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:20:56,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 19:20:56,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 19:20:56,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 19:20:56,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 19:20:56,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 19:20:56,865 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 19:20:56,865 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 19:20:56,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 19:20:56,865 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 -> 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e [2022-07-13 19:20:57,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 19:20:57,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 19:20:57,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 19:20:57,078 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 19:20:57,078 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 19:20:57,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2022-07-13 19:20:57,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1839fb387/5b6adb0f47df48ea95cc8c9f827446cb/FLAG69a11500d [2022-07-13 19:20:57,626 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 19:20:57,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2022-07-13 19:20:57,656 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1839fb387/5b6adb0f47df48ea95cc8c9f827446cb/FLAG69a11500d [2022-07-13 19:20:58,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1839fb387/5b6adb0f47df48ea95cc8c9f827446cb [2022-07-13 19:20:58,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 19:20:58,157 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 19:20:58,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 19:20:58,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 19:20:58,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 19:20:58,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72907291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58, skipping insertion in model container [2022-07-13 19:20:58,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 19:20:58,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 19:20:58,535 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-1.i[23400,23413] [2022-07-13 19:20:58,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:20:58,642 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 19:20:58,669 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-1.i[23400,23413] [2022-07-13 19:20:58,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 19:20:58,734 INFO L208 MainTranslator]: Completed translation [2022-07-13 19:20:58,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58 WrapperNode [2022-07-13 19:20:58,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 19:20:58,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 19:20:58,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 19:20:58,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 19:20:58,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,804 INFO L137 Inliner]: procedures = 144, calls = 231, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 563 [2022-07-13 19:20:58,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 19:20:58,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 19:20:58,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 19:20:58,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 19:20:58,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 19:20:58,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 19:20:58,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 19:20:58,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 19:20:58,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58" (1/1) ... [2022-07-13 19:20:58,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 19:20:58,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:20:58,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 19:20:58,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 19:20:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 19:20:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 19:20:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 19:20:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 19:20:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 19:20:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2022-07-13 19:20:58,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2022-07-13 19:20:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-13 19:20:58,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-13 19:20:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-13 19:20:58,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-13 19:20:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 19:20:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-13 19:20:58,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-13 19:20:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:20:58,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:20:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 19:20:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 19:20:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-13 19:20:58,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-13 19:20:58,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 19:20:58,925 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-13 19:20:58,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-13 19:20:58,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 19:20:58,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 19:20:59,024 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 19:20:59,026 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 19:20:59,282 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: SUMMARY for call __CS_cs(); srcloc: null [2022-07-13 19:20:59,282 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-13 19:20:59,282 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:59,283 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:59,283 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-13 19:20:59,283 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != ~__CS_ret~0 % 256); [2022-07-13 19:20:59,283 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-13 19:21:01,550 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 19:21:01,556 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 19:21:01,556 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 19:21:01,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:01 BoogieIcfgContainer [2022-07-13 19:21:01,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 19:21:01,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 19:21:01,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 19:21:01,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 19:21:01,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 07:20:58" (1/3) ... [2022-07-13 19:21:01,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386fa3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:21:01, skipping insertion in model container [2022-07-13 19:21:01,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:20:58" (2/3) ... [2022-07-13 19:21:01,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386fa3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:21:01, skipping insertion in model container [2022-07-13 19:21:01,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:01" (3/3) ... [2022-07-13 19:21:01,563 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-1.i [2022-07-13 19:21:01,572 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 19:21:01,572 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 19:21:01,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 19:21:01,606 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@689aeadb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62752f2d [2022-07-13 19:21:01,606 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 19:21:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 121 states have (on average 1.5041322314049588) internal successors, (182), 122 states have internal predecessors, (182), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-07-13 19:21:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 19:21:01,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:01,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:01,617 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1724368089, now seen corresponding path program 1 times [2022-07-13 19:21:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:01,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578514803] [2022-07-13 19:21:01,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:01,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 19:21:02,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:02,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578514803] [2022-07-13 19:21:02,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578514803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:02,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:02,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:21:02,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459759668] [2022-07-13 19:21:02,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:02,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:21:02,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:02,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:21:02,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:02,037 INFO L87 Difference]: Start difference. First operand has 172 states, 121 states have (on average 1.5041322314049588) internal successors, (182), 122 states have internal predecessors, (182), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:21:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:02,124 INFO L93 Difference]: Finished difference Result 347 states and 569 transitions. [2022-07-13 19:21:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:21:02,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) Word has length 32 [2022-07-13 19:21:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:02,136 INFO L225 Difference]: With dead ends: 347 [2022-07-13 19:21:02,138 INFO L226 Difference]: Without dead ends: 173 [2022-07-13 19:21:02,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:02,148 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 5 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:02,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 492 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-13 19:21:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2022-07-13 19:21:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-07-13 19:21:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 248 transitions. [2022-07-13 19:21:02,223 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 248 transitions. Word has length 32 [2022-07-13 19:21:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:02,223 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 248 transitions. [2022-07-13 19:21:02,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:21:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 248 transitions. [2022-07-13 19:21:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 19:21:02,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:02,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:02,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 19:21:02,239 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1488698589, now seen corresponding path program 1 times [2022-07-13 19:21:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:02,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206530121] [2022-07-13 19:21:02,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 19:21:02,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:02,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206530121] [2022-07-13 19:21:02,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206530121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:02,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:02,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 19:21:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79522786] [2022-07-13 19:21:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:02,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 19:21:02,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:02,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 19:21:02,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:02,409 INFO L87 Difference]: Start difference. First operand 169 states and 248 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:21:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:02,446 INFO L93 Difference]: Finished difference Result 337 states and 496 transitions. [2022-07-13 19:21:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 19:21:02,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) Word has length 36 [2022-07-13 19:21:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:02,449 INFO L225 Difference]: With dead ends: 337 [2022-07-13 19:21:02,449 INFO L226 Difference]: Without dead ends: 171 [2022-07-13 19:21:02,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 19:21:02,452 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 1 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:02,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-13 19:21:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2022-07-13 19:21:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-07-13 19:21:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 249 transitions. [2022-07-13 19:21:02,475 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 249 transitions. Word has length 36 [2022-07-13 19:21:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:02,475 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 249 transitions. [2022-07-13 19:21:02,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:21:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 249 transitions. [2022-07-13 19:21:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 19:21:02,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:02,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 19:21:02,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 19:21:02,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:02,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash 967627515, now seen corresponding path program 1 times [2022-07-13 19:21:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:02,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567938036] [2022-07-13 19:21:02,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:02,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 19:21:02,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:02,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567938036] [2022-07-13 19:21:02,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567938036] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:02,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576843663] [2022-07-13 19:21:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:02,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:02,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:02,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:02,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 19:21:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:03,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:21:03,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 19:21:03,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 19:21:03,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576843663] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:03,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:03,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-13 19:21:03,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225606415] [2022-07-13 19:21:03,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:03,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 19:21:03,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:03,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 19:21:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:03,138 INFO L87 Difference]: Start difference. First operand 170 states and 249 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:21:03,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:03,166 INFO L93 Difference]: Finished difference Result 341 states and 501 transitions. [2022-07-13 19:21:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 19:21:03,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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) Word has length 38 [2022-07-13 19:21:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:03,168 INFO L225 Difference]: With dead ends: 341 [2022-07-13 19:21:03,168 INFO L226 Difference]: Without dead ends: 174 [2022-07-13 19:21:03,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:03,170 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 3 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:03,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 971 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-13 19:21:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-07-13 19:21:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-07-13 19:21:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 253 transitions. [2022-07-13 19:21:03,179 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 253 transitions. Word has length 38 [2022-07-13 19:21:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:03,179 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 253 transitions. [2022-07-13 19:21:03,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:21:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 253 transitions. [2022-07-13 19:21:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 19:21:03,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:03,180 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 19:21:03,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:03,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:03,409 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash -624054089, now seen corresponding path program 2 times [2022-07-13 19:21:03,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:03,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005884023] [2022-07-13 19:21:03,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 19:21:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:03,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005884023] [2022-07-13 19:21:03,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005884023] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:03,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182315244] [2022-07-13 19:21:03,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 19:21:03,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:03,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:03,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:03,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 19:21:04,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 19:21:04,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 19:21:04,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 1584 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 19:21:04,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 19:21:04,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 19:21:04,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182315244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:04,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 19:21:04,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 19:21:04,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443564705] [2022-07-13 19:21:04,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:04,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 19:21:04,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:04,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 19:21:04,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 19:21:04,583 INFO L87 Difference]: Start difference. First operand 174 states and 253 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:21:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:04,612 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2022-07-13 19:21:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 19:21:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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) Word has length 42 [2022-07-13 19:21:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:04,617 INFO L225 Difference]: With dead ends: 332 [2022-07-13 19:21:04,617 INFO L226 Difference]: Without dead ends: 306 [2022-07-13 19:21:04,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 19:21:04,618 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 206 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:04,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 934 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 19:21:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-13 19:21:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2022-07-13 19:21:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) [2022-07-13 19:21:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 466 transitions. [2022-07-13 19:21:04,637 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 466 transitions. Word has length 42 [2022-07-13 19:21:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:04,637 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 466 transitions. [2022-07-13 19:21:04,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:21:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 466 transitions. [2022-07-13 19:21:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 19:21:04,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:04,640 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 19:21:04,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 19:21:04,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 19:21:04,854 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1759881955, now seen corresponding path program 1 times [2022-07-13 19:21:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:04,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078578008] [2022-07-13 19:21:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:04,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:05,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 19:21:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:05,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:05,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:21:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:05,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 19:21:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:05,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:21:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:05,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 19:21:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:05,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 19:21:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-13 19:21:05,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:05,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078578008] [2022-07-13 19:21:05,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078578008] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:05,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601751336] [2022-07-13 19:21:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:05,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:05,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:05,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:05,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 19:21:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:05,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 2039 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 19:21:05,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-13 19:21:05,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-13 19:21:05,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601751336] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:05,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:05,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-07-13 19:21:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624490800] [2022-07-13 19:21:05,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:05,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 19:21:05,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:05,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 19:21:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 19:21:05,809 INFO L87 Difference]: Start difference. First operand 305 states and 466 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 19:21:07,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:09,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:11,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:13,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:13,567 INFO L93 Difference]: Finished difference Result 617 states and 950 transitions. [2022-07-13 19:21:13,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 19:21:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2022-07-13 19:21:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:13,570 INFO L225 Difference]: With dead ends: 617 [2022-07-13 19:21:13,570 INFO L226 Difference]: Without dead ends: 325 [2022-07-13 19:21:13,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-13 19:21:13,572 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 36 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:13,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 966 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 564 Invalid, 3 Unknown, 0 Unchecked, 7.7s Time] [2022-07-13 19:21:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-13 19:21:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 319. [2022-07-13 19:21:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 219 states have (on average 1.3926940639269407) internal successors, (305), 221 states have internal predecessors, (305), 83 states have call successors, (83), 14 states have call predecessors, (83), 16 states have return successors, (97), 83 states have call predecessors, (97), 83 states have call successors, (97) [2022-07-13 19:21:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 485 transitions. [2022-07-13 19:21:13,606 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 485 transitions. Word has length 100 [2022-07-13 19:21:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:13,607 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 485 transitions. [2022-07-13 19:21:13,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 19:21:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 485 transitions. [2022-07-13 19:21:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 19:21:13,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:13,611 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 19:21:13,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:13,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:13,846 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:13,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash -420954683, now seen corresponding path program 2 times [2022-07-13 19:21:13,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:13,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153987612] [2022-07-13 19:21:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:21:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:14,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 19:21:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:14,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:21:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:14,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 19:21:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:14,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 19:21:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-13 19:21:14,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:14,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153987612] [2022-07-13 19:21:14,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153987612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 19:21:14,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 19:21:14,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 19:21:14,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671543073] [2022-07-13 19:21:14,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 19:21:14,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 19:21:14,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:14,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 19:21:14,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 19:21:14,321 INFO L87 Difference]: Start difference. First operand 319 states and 485 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 19:21:16,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:17,155 INFO L93 Difference]: Finished difference Result 662 states and 1021 transitions. [2022-07-13 19:21:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 19:21:17,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 110 [2022-07-13 19:21:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:17,159 INFO L225 Difference]: With dead ends: 662 [2022-07-13 19:21:17,160 INFO L226 Difference]: Without dead ends: 636 [2022-07-13 19:21:17,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-07-13 19:21:17,161 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 313 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 167 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:17,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 929 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 677 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-07-13 19:21:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-07-13 19:21:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 595. [2022-07-13 19:21:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 394 states have (on average 1.4238578680203047) internal successors, (561), 401 states have internal predecessors, (561), 165 states have call successors, (165), 28 states have call predecessors, (165), 35 states have return successors, (209), 165 states have call predecessors, (209), 165 states have call successors, (209) [2022-07-13 19:21:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 935 transitions. [2022-07-13 19:21:17,219 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 935 transitions. Word has length 110 [2022-07-13 19:21:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:17,221 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 935 transitions. [2022-07-13 19:21:17,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 19:21:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 935 transitions. [2022-07-13 19:21:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 19:21:17,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 19:21:17,226 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 19:21:17,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 19:21:17,226 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 19:21:17,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 19:21:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash -593993191, now seen corresponding path program 1 times [2022-07-13 19:21:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 19:21:17,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599436274] [2022-07-13 19:21:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:17,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 19:21:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:30,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 19:21:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:30,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 19:21:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:30,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 19:21:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:30,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 19:21:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 19:21:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:30,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 19:21:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:30,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 19:21:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-13 19:21:30,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 19:21:30,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599436274] [2022-07-13 19:21:30,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599436274] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 19:21:30,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35723992] [2022-07-13 19:21:30,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 19:21:30,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:30,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 19:21:30,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 19:21:30,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 19:21:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 19:21:31,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 2211 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 19:21:31,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 19:21:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 19:21:31,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 19:21:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 19:21:31,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35723992] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 19:21:31,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 19:21:31,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 22 [2022-07-13 19:21:31,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997879651] [2022-07-13 19:21:31,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 19:21:31,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 19:21:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 19:21:31,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 19:21:31,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-07-13 19:21:31,927 INFO L87 Difference]: Start difference. First operand 595 states and 935 transitions. Second operand has 22 states, 21 states have (on average 6.904761904761905) internal successors, (145), 16 states have internal predecessors, (145), 6 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (19), 10 states have call predecessors, (19), 6 states have call successors, (19) [2022-07-13 19:21:34,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 19:21:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 19:21:35,922 INFO L93 Difference]: Finished difference Result 1632 states and 2674 transitions. [2022-07-13 19:21:35,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 19:21:35,922 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.904761904761905) internal successors, (145), 16 states have internal predecessors, (145), 6 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (19), 10 states have call predecessors, (19), 6 states have call successors, (19) Word has length 110 [2022-07-13 19:21:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 19:21:35,923 INFO L225 Difference]: With dead ends: 1632 [2022-07-13 19:21:35,923 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 19:21:35,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2022-07-13 19:21:35,931 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 1104 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 781 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 781 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-13 19:21:35,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1075 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [781 Valid, 1489 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-07-13 19:21:35,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 19:21:35,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 19:21:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 19:21:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 19:21:35,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2022-07-13 19:21:35,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 19:21:35,935 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 19:21:35,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.904761904761905) internal successors, (145), 16 states have internal predecessors, (145), 6 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (19), 10 states have call predecessors, (19), 6 states have call successors, (19) [2022-07-13 19:21:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 19:21:35,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 19:21:35,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 19:21:35,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 19:21:36,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 19:21:36,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 19:21:39,598 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_initEXIT(lines 565 568) no Hoare annotation was computed. [2022-07-13 19:21:39,598 INFO L902 garLoopResultBuilder]: At program point __CS_pthread_mutex_initENTRY(lines 565 568) the Hoare annotation is: true [2022-07-13 19:21:39,598 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_initFINAL(lines 565 568) no Hoare annotation was computed. [2022-07-13 19:21:39,598 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_joinEXIT(lines 638 659) no Hoare annotation was computed. [2022-07-13 19:21:39,598 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 645) no Hoare annotation was computed. [2022-07-13 19:21:39,598 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_joinENTRY(lines 638 659) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= ~__CS_error~0 |old(~__CS_error~0)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,598 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_joinFINAL(lines 638 659) no Hoare annotation was computed. [2022-07-13 19:21:39,598 INFO L899 garLoopResultBuilder]: For program point L657(line 657) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point L657-2(line 657) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point L651(lines 651 656) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point L646(line 646) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point L646-2(lines 646 650) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_mutex_lockENTRY(lines 578 583) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockEXIT(lines 578 583) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point L580(lines 580 581) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point L580-1(lines 580 581) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockFINAL(lines 578 583) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L895 garLoopResultBuilder]: At program point L729(line 729) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point L729-1(lines 718 749) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L895 garLoopResultBuilder]: At program point L713(line 713) 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point L713-1(lines 702 716) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L895 garLoopResultBuilder]: At program point L730(line 730) 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point L730-1(line 730) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L895 garLoopResultBuilder]: At program point L697(line 697) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)) (or (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1))) [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point L697-1(lines 686 700) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$FINAL(line -1) no Hoare annotation was computed. [2022-07-13 19:21:39,599 INFO L895 garLoopResultBuilder]: At program point L714(line 714) 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,600 INFO L899 garLoopResultBuilder]: For program point L714-1(line 714) no Hoare annotation was computed. [2022-07-13 19:21:39,600 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$EXIT(line -1) no Hoare annotation was computed. [2022-07-13 19:21:39,600 INFO L895 garLoopResultBuilder]: At program point L731(line 731) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:21:39,600 INFO L899 garLoopResultBuilder]: For program point L731-1(lines 718 749) no Hoare annotation was computed. [2022-07-13 19:21:39,600 INFO L895 garLoopResultBuilder]: At program point L698(line 698) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)) (or (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1))) [2022-07-13 19:21:39,600 INFO L899 garLoopResultBuilder]: For program point L698-1(line 698) no Hoare annotation was computed. [2022-07-13 19:21:39,600 INFO L899 garLoopResultBuilder]: For program point L748(lines 718 749) no Hoare annotation was computed. [2022-07-13 19:21:39,600 INFO L895 garLoopResultBuilder]: At program point L715(line 715) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)) (or .cse0 (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)) .cse1))) [2022-07-13 19:21:39,600 INFO L899 garLoopResultBuilder]: For program point L715-1(lines 702 716) no Hoare annotation was computed. [2022-07-13 19:21:39,600 INFO L895 garLoopResultBuilder]: At program point L732(line 732) 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:21:39,600 INFO L899 garLoopResultBuilder]: For program point L732-1(line 732) no Hoare annotation was computed. [2022-07-13 19:21:39,600 INFO L895 garLoopResultBuilder]: At program point L699(line 699) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-13 19:21:39,600 INFO L899 garLoopResultBuilder]: For program point L699-1(lines 686 700) no Hoare annotation was computed. [2022-07-13 19:21:39,600 INFO L895 garLoopResultBuilder]: At program point L733(line 733) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:21:39,600 INFO L899 garLoopResultBuilder]: For program point L733-1(lines 718 749) no Hoare annotation was computed. [2022-07-13 19:21:39,600 INFO L895 garLoopResultBuilder]: At program point L717(lines 717 749) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,600 INFO L895 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-07-13 19:21:39,600 INFO L899 garLoopResultBuilder]: For program point L734-1(line 734) no Hoare annotation was computed. [2022-07-13 19:21:39,600 INFO L895 garLoopResultBuilder]: At program point L701(lines 701 716) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)) (or .cse0 (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)) .cse1))) [2022-07-13 19:21:39,600 INFO L895 garLoopResultBuilder]: At program point L685(lines 685 700) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-13 19:21:39,601 INFO L895 garLoopResultBuilder]: At program point L735(line 735) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,601 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 718 749) no Hoare annotation was computed. [2022-07-13 19:21:39,601 INFO L895 garLoopResultBuilder]: At program point L736(line 736) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,601 INFO L899 garLoopResultBuilder]: For program point L736-1(line 736) no Hoare annotation was computed. [2022-07-13 19:21:39,601 INFO L895 garLoopResultBuilder]: At program point L703(line 703) 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)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,601 INFO L899 garLoopResultBuilder]: For program point L703-1(lines 702 716) no Hoare annotation was computed. [2022-07-13 19:21:39,601 INFO L895 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,601 INFO L899 garLoopResultBuilder]: For program point L687-1(lines 686 700) no Hoare annotation was computed. [2022-07-13 19:21:39,601 INFO L895 garLoopResultBuilder]: At program point L737(line 737) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,601 INFO L899 garLoopResultBuilder]: For program point L737-1(lines 718 749) no Hoare annotation was computed. [2022-07-13 19:21:39,601 INFO L895 garLoopResultBuilder]: At program point L704(line 704) 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,601 INFO L899 garLoopResultBuilder]: For program point L704-1(line 704) no Hoare annotation was computed. [2022-07-13 19:21:39,601 INFO L895 garLoopResultBuilder]: At program point L721(line 721) 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 (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |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.offset| 0))) .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,601 INFO L899 garLoopResultBuilder]: For program point L721-1(lines 718 749) no Hoare annotation was computed. [2022-07-13 19:21:39,601 INFO L895 garLoopResultBuilder]: At program point L688(line 688) 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 .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)) (or (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1))) [2022-07-13 19:21:39,601 INFO L899 garLoopResultBuilder]: For program point L688-1(line 688) no Hoare annotation was computed. [2022-07-13 19:21:39,601 INFO L899 garLoopResultBuilder]: For program point L738(line 738) no Hoare annotation was computed. [2022-07-13 19:21:39,601 INFO L895 garLoopResultBuilder]: At program point L705(line 705) the Hoare annotation is: (let ((.cse2 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse3 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (let ((.cse1 (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)))) (or (let ((.cse0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and (<= .cse0 ~__CS_ret_PREEMPTED~0) .cse1 (<= ~__CS_ret_PREEMPTED~0 .cse0))) .cse2 (and (= (mod ~__CS_ret~0 256) 0) .cse1) .cse3)) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse2 .cse3) (or .cse2 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse3 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,601 INFO L899 garLoopResultBuilder]: For program point L738-2(lines 738 747) no Hoare annotation was computed. [2022-07-13 19:21:39,602 INFO L899 garLoopResultBuilder]: For program point L705-1(lines 702 716) no Hoare annotation was computed. [2022-07-13 19:21:39,602 INFO L895 garLoopResultBuilder]: At program point L738-4(lines 738 747) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,602 INFO L895 garLoopResultBuilder]: At program point L722(line 722) 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,602 INFO L899 garLoopResultBuilder]: For program point L722-1(line 722) no Hoare annotation was computed. [2022-07-13 19:21:39,602 INFO L895 garLoopResultBuilder]: At program point L689(line 689) the Hoare annotation is: (let ((.cse1 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse2 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (= (mod ~__CS_ret~0 256) 0) (let ((.cse0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and (<= .cse0 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 .cse0))) .cse1 .cse2) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse1 .cse2) (or .cse1 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse2 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,602 INFO L899 garLoopResultBuilder]: For program point L689-1(lines 686 700) no Hoare annotation was computed. [2022-07-13 19:21:39,602 INFO L895 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~$Pointer$ENTRY(line -1) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,602 INFO L895 garLoopResultBuilder]: At program point L723(line 723) 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,602 INFO L899 garLoopResultBuilder]: For program point L723-1(lines 718 749) no Hoare annotation was computed. [2022-07-13 19:21:39,602 INFO L895 garLoopResultBuilder]: At program point L740(line 740) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,602 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 739 747) no Hoare annotation was computed. [2022-07-13 19:21:39,602 INFO L895 garLoopResultBuilder]: At program point L707(line 707) 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,602 INFO L899 garLoopResultBuilder]: For program point L707-1(lines 702 716) no Hoare annotation was computed. [2022-07-13 19:21:39,602 INFO L895 garLoopResultBuilder]: At program point L724(line 724) 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,602 INFO L899 garLoopResultBuilder]: For program point L724-1(line 724) no Hoare annotation was computed. [2022-07-13 19:21:39,602 INFO L895 garLoopResultBuilder]: At program point L691(line 691) 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 .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)) (or (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1))) [2022-07-13 19:21:39,602 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 686 700) no Hoare annotation was computed. [2022-07-13 19:21:39,602 INFO L895 garLoopResultBuilder]: At program point L708(line 708) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,603 INFO L899 garLoopResultBuilder]: For program point L708-1(line 708) no Hoare annotation was computed. [2022-07-13 19:21:39,603 INFO L895 garLoopResultBuilder]: At program point L725(line 725) 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,603 INFO L899 garLoopResultBuilder]: For program point L725-1(lines 718 749) no Hoare annotation was computed. [2022-07-13 19:21:39,603 INFO L895 garLoopResultBuilder]: At program point L692(line 692) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)) (or (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1))) [2022-07-13 19:21:39,603 INFO L899 garLoopResultBuilder]: For program point L692-1(line 692) no Hoare annotation was computed. [2022-07-13 19:21:39,603 INFO L895 garLoopResultBuilder]: At program point L709(line 709) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)) (or .cse0 (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)) .cse1))) [2022-07-13 19:21:39,603 INFO L899 garLoopResultBuilder]: For program point L709-1(lines 702 716) no Hoare annotation was computed. [2022-07-13 19:21:39,616 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 19:21:39,616 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-13 19:21:39,616 INFO L899 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2022-07-13 19:21:39,617 INFO L895 garLoopResultBuilder]: At program point L693(line 693) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-13 19:21:39,617 INFO L899 garLoopResultBuilder]: For program point L693-1(lines 686 700) no Hoare annotation was computed. [2022-07-13 19:21:39,617 INFO L895 garLoopResultBuilder]: At program point L743(lines 739 747) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,617 INFO L895 garLoopResultBuilder]: At program point L710(line 710) 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,619 INFO L899 garLoopResultBuilder]: For program point L710-1(line 710) no Hoare annotation was computed. [2022-07-13 19:21:39,619 INFO L895 garLoopResultBuilder]: At program point L727(line 727) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,619 INFO L899 garLoopResultBuilder]: For program point L727-1(lines 718 749) no Hoare annotation was computed. [2022-07-13 19:21:39,619 INFO L895 garLoopResultBuilder]: At program point L694(line 694) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse1 (= (select ~__CS_thread~0.offset 2) 0)) (or (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1))) [2022-07-13 19:21:39,619 INFO L899 garLoopResultBuilder]: For program point L694-1(line 694) no Hoare annotation was computed. [2022-07-13 19:21:39,619 INFO L895 garLoopResultBuilder]: At program point L711(line 711) the Hoare annotation is: (let ((.cse2 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse3 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (let ((.cse1 (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)))) (or (let ((.cse0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and (<= .cse0 ~__CS_ret_PREEMPTED~0) .cse1 (<= ~__CS_ret_PREEMPTED~0 .cse0))) .cse2 (and (= (mod ~__CS_ret~0 256) 0) .cse1) .cse3)) (or .cse2 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse3 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,620 INFO L899 garLoopResultBuilder]: For program point L711-1(lines 702 716) no Hoare annotation was computed. [2022-07-13 19:21:39,620 INFO L895 garLoopResultBuilder]: At program point L695(line 695) the Hoare annotation is: (let ((.cse1 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse2 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (= (mod ~__CS_ret~0 256) 0) (let ((.cse0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and (<= .cse0 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 .cse0))) .cse1 .cse2) (or .cse1 (not (= (select |old(~__CS_thread~0.offset)| 2) 0)) .cse2 (= (select ~__CS_thread~0.offset 2) 0)))) [2022-07-13 19:21:39,620 INFO L899 garLoopResultBuilder]: For program point L695-1(lines 686 700) no Hoare annotation was computed. [2022-07-13 19:21:39,621 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_mutex_unlockENTRY(lines 584 592) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-13 19:21:39,621 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2022-07-13 19:21:39,621 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockFINAL(lines 584 592) no Hoare annotation was computed. [2022-07-13 19:21:39,621 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockEXIT(lines 584 592) no Hoare annotation was computed. [2022-07-13 19:21:39,621 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_createFINAL(lines 660 673) no Hoare annotation was computed. [2022-07-13 19:21:39,621 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_createEXIT(lines 660 673) no Hoare annotation was computed. [2022-07-13 19:21:39,622 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_createENTRY(lines 660 673) the Hoare annotation is: (or (not (= (mod ~__CS_ret~0 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= ~__CS_ret_PREEMPTED~0 1))) [2022-07-13 19:21:39,622 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 665) no Hoare annotation was computed. [2022-07-13 19:21:39,622 INFO L899 garLoopResultBuilder]: For program point L803-2(line 803) no Hoare annotation was computed. [2022-07-13 19:21:39,622 INFO L895 garLoopResultBuilder]: At program point L787(line 787) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_error~0 0) (= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-13 19:21:39,622 INFO L899 garLoopResultBuilder]: For program point L787-1(line 787) no Hoare annotation was computed. [2022-07-13 19:21:39,622 INFO L899 garLoopResultBuilder]: For program point L804(line 804) no Hoare annotation was computed. [2022-07-13 19:21:39,622 INFO L899 garLoopResultBuilder]: For program point L804-2(line 804) no Hoare annotation was computed. [2022-07-13 19:21:39,622 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 19:21:39,622 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 19:21:39,623 INFO L899 garLoopResultBuilder]: For program point L796(lines 796 801) no Hoare annotation was computed. [2022-07-13 19:21:39,623 INFO L899 garLoopResultBuilder]: For program point L796-1(lines 796 801) no Hoare annotation was computed. [2022-07-13 19:21:39,623 INFO L899 garLoopResultBuilder]: For program point L788(line 788) no Hoare annotation was computed. [2022-07-13 19:21:39,623 INFO L899 garLoopResultBuilder]: For program point L805(line 805) no Hoare annotation was computed. [2022-07-13 19:21:39,623 INFO L899 garLoopResultBuilder]: For program point L805-2(line 805) no Hoare annotation was computed. [2022-07-13 19:21:39,624 INFO L899 garLoopResultBuilder]: For program point L806(line 806) no Hoare annotation was computed. [2022-07-13 19:21:39,624 INFO L899 garLoopResultBuilder]: For program point L806-2(line 806) no Hoare annotation was computed. [2022-07-13 19:21:39,624 INFO L899 garLoopResultBuilder]: For program point L790(lines 790 795) no Hoare annotation was computed. [2022-07-13 19:21:39,624 INFO L899 garLoopResultBuilder]: For program point L790-1(lines 790 795) no Hoare annotation was computed. [2022-07-13 19:21:39,624 INFO L899 garLoopResultBuilder]: For program point L807(line 807) no Hoare annotation was computed. [2022-07-13 19:21:39,625 INFO L899 garLoopResultBuilder]: For program point L807-2(line 807) no Hoare annotation was computed. [2022-07-13 19:21:39,625 INFO L895 garLoopResultBuilder]: At program point L799(line 799) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2022-07-13 19:21:39,625 INFO L899 garLoopResultBuilder]: For program point L799-1(line 799) no Hoare annotation was computed. [2022-07-13 19:21:39,625 INFO L899 garLoopResultBuilder]: For program point L535(lines 535 537) no Hoare annotation was computed. [2022-07-13 19:21:39,625 INFO L902 garLoopResultBuilder]: At program point L535-2(lines 534 539) the Hoare annotation is: true [2022-07-13 19:21:39,625 INFO L899 garLoopResultBuilder]: For program point L758-2(lines 758 767) no Hoare annotation was computed. [2022-07-13 19:21:39,625 INFO L895 garLoopResultBuilder]: At program point L758-3(lines 758 767) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-13 19:21:39,625 INFO L899 garLoopResultBuilder]: For program point L758-4(lines 758 767) no Hoare annotation was computed. [2022-07-13 19:21:39,625 INFO L899 garLoopResultBuilder]: For program point L750(lines 750 813) no Hoare annotation was computed. [2022-07-13 19:21:39,626 INFO L899 garLoopResultBuilder]: For program point L808(line 808) no Hoare annotation was computed. [2022-07-13 19:21:39,626 INFO L899 garLoopResultBuilder]: For program point L808-2(line 808) no Hoare annotation was computed. [2022-07-13 19:21:39,626 INFO L899 garLoopResultBuilder]: For program point L800(line 800) no Hoare annotation was computed. [2022-07-13 19:21:39,626 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 19:21:39,626 INFO L899 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2022-07-13 19:21:39,626 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 536) no Hoare annotation was computed. [2022-07-13 19:21:39,626 INFO L899 garLoopResultBuilder]: For program point L759-2(lines 759 762) no Hoare annotation was computed. [2022-07-13 19:21:39,626 INFO L895 garLoopResultBuilder]: At program point L759-3(lines 759 762) 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) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-13 19:21:39,626 INFO L899 garLoopResultBuilder]: For program point L759-4(lines 759 762) no Hoare annotation was computed. [2022-07-13 19:21:39,627 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 789) no Hoare annotation was computed. [2022-07-13 19:21:39,627 INFO L899 garLoopResultBuilder]: For program point L784-1(lines 784 789) no Hoare annotation was computed. [2022-07-13 19:21:39,627 INFO L899 garLoopResultBuilder]: For program point L809(line 809) no Hoare annotation was computed. [2022-07-13 19:21:39,628 INFO L899 garLoopResultBuilder]: For program point L809-2(line 809) no Hoare annotation was computed. [2022-07-13 19:21:39,628 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 19:21:39,628 INFO L895 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2022-07-13 19:21:39,628 INFO L899 garLoopResultBuilder]: For program point L793-1(line 793) no Hoare annotation was computed. [2022-07-13 19:21:39,628 INFO L899 garLoopResultBuilder]: For program point L810(line 810) no Hoare annotation was computed. [2022-07-13 19:21:39,628 INFO L899 garLoopResultBuilder]: For program point L810-2(line 810) no Hoare annotation was computed. [2022-07-13 19:21:39,628 INFO L899 garLoopResultBuilder]: For program point L802(line 802) no Hoare annotation was computed. [2022-07-13 19:21:39,629 INFO L899 garLoopResultBuilder]: For program point L802-2(line 802) no Hoare annotation was computed. [2022-07-13 19:21:39,629 INFO L899 garLoopResultBuilder]: For program point L794(line 794) no Hoare annotation was computed. [2022-07-13 19:21:39,629 INFO L899 garLoopResultBuilder]: For program point L811(line 811) no Hoare annotation was computed. [2022-07-13 19:21:39,629 INFO L899 garLoopResultBuilder]: For program point L811-2(line 811) no Hoare annotation was computed. [2022-07-13 19:21:39,629 INFO L899 garLoopResultBuilder]: For program point L803(line 803) no Hoare annotation was computed. [2022-07-13 19:21:39,629 INFO L899 garLoopResultBuilder]: For program point L563(line 563) no Hoare annotation was computed. [2022-07-13 19:21:39,629 INFO L899 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-07-13 19:21:39,629 INFO L899 garLoopResultBuilder]: For program point L563-2(line 563) no Hoare annotation was computed. [2022-07-13 19:21:39,631 INFO L899 garLoopResultBuilder]: For program point L561-2(line 561) no Hoare annotation was computed. [2022-07-13 19:21:39,631 INFO L899 garLoopResultBuilder]: For program point __CS_csEXIT(lines 558 564) no Hoare annotation was computed. [2022-07-13 19:21:39,631 INFO L895 garLoopResultBuilder]: At program point __CS_csENTRY(lines 558 564) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))) [2022-07-13 19:21:39,631 INFO L899 garLoopResultBuilder]: For program point __CS_csFINAL(lines 558 564) no Hoare annotation was computed. [2022-07-13 19:21:39,634 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-07-13 19:21:39,635 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 19:21:39,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,657 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,657 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 07:21:39 BoogieIcfgContainer [2022-07-13 19:21:39,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 19:21:39,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 19:21:39,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 19:21:39,675 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 19:21:39,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:21:01" (3/4) ... [2022-07-13 19:21:39,678 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 19:21:39,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2022-07-13 19:21:39,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2022-07-13 19:21:39,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-13 19:21:39,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2022-07-13 19:21:39,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2022-07-13 19:21:39,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2022-07-13 19:21:39,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_init [2022-07-13 19:21:39,707 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2022-07-13 19:21:39,708 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2022-07-13 19:21:39,708 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-13 19:21:39,709 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-13 19:21:39,732 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(__CS_ret_PREEMPTED == 1) || !(\old(__CS_thread)[2] == 0)) || !(\old(__CS_ret) % 256 == 0)) || __CS_thread[2] == 0) && ((!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0)) [2022-07-13 19:21:39,732 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(__CS_ret_PREEMPTED == 1) || !(\old(__CS_thread)[2] == 0)) || !(\old(__CS_ret) % 256 == 0)) || __CS_thread[2] == 0 [2022-07-13 19:21:39,732 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) [2022-07-13 19:21:39,737 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(__CS_ret_PREEMPTED == 1) || (__CS_ret % 256 == 0 && !(#fp == 0))) || !(\old(__CS_ret) % 256 == 0) [2022-07-13 19:21:39,783 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 19:21:39,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 19:21:39,784 INFO L158 Benchmark]: Toolchain (without parser) took 41626.91ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 107.3MB in the beginning and 146.6MB in the end (delta: -39.4MB). Peak memory consumption was 288.7MB. Max. memory is 16.1GB. [2022-07-13 19:21:39,784 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory was 56.6MB in the beginning and 56.5MB in the end (delta: 47.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 19:21:39,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.76ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 101.0MB in the end (delta: 6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 19:21:39,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.56ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 96.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 19:21:39,785 INFO L158 Benchmark]: Boogie Preprocessor took 66.64ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 93.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 19:21:39,785 INFO L158 Benchmark]: RCFGBuilder took 2685.43ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 82.3MB in the end (delta: 10.6MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2022-07-13 19:21:39,785 INFO L158 Benchmark]: TraceAbstraction took 38111.53ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 81.6MB in the beginning and 156.1MB in the end (delta: -74.5MB). Peak memory consumption was 273.0MB. Max. memory is 16.1GB. [2022-07-13 19:21:39,786 INFO L158 Benchmark]: Witness Printer took 112.07ms. Allocated memory is still 469.8MB. Free memory was 156.1MB in the beginning and 146.6MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 19:21:39,787 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 100.7MB. Free memory was 56.6MB in the beginning and 56.5MB in the end (delta: 47.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.76ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 101.0MB in the end (delta: 6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.56ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 96.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.64ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 93.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2685.43ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 82.3MB in the end (delta: 10.6MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38111.53ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 81.6MB in the beginning and 156.1MB in the end (delta: -74.5MB). Peak memory consumption was 273.0MB. Max. memory is 16.1GB. * Witness Printer took 112.07ms. Allocated memory is still 469.8MB. Free memory was 156.1MB in the beginning and 146.6MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.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.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.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.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: 536]: 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 8 procedures, 172 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.0s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1697 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1668 mSDsluCounter, 5854 SdHoareTripleChecker+Invalid, 13.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4008 mSDsCounter, 1001 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2767 IncrementalHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1001 mSolverCounterUnsat, 1846 mSDtfsCounter, 2767 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 571 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=595occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 53 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 1913 PreInvPairs, 2957 NumberOfFragments, 2178 HoareAnnotationTreeSize, 1913 FomulaSimplifications, 2999 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 56 FomulaSimplificationsInter, 13728 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 14.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 758 NumberOfCodeBlocks, 748 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 992 ConstructedInterpolants, 0 QuantifiedInterpolants, 2409 SizeOfPredicates, 7 NumberOfNonLiveVariables, 7535 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 518/543 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: 759]: Loop Invariant [2022-07-13 19:21:39,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,803 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) && __CS_thread[2] == 0 - InvariantResult [Line: 701]: Loop Invariant [2022-07-13 19:21:39,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,807 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_PREEMPTED == 1) || !(\old(__CS_thread)[2] == 0)) || !(\old(__CS_ret) % 256 == 0)) || __CS_thread[2] == 0) && ((!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0)) - InvariantResult [Line: 739]: Loop Invariant Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || (__CS_ret % 256 == 0 && !(#fp == 0))) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 534]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 758]: Loop Invariant [2022-07-13 19:21:39,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,811 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) && __CS_thread[2] == 0 - InvariantResult [Line: 685]: Loop Invariant [2022-07-13 19:21:39,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-13 19:21:39,812 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_PREEMPTED == 1) || !(\old(__CS_thread)[2] == 0)) || !(\old(__CS_ret) % 256 == 0)) || __CS_thread[2] == 0 RESULT: Ultimate proved your program to be correct! [2022-07-13 19:21:39,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE