./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:29:28,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:29:28,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:29:28,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:29:28,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:29:28,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:29:28,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:29:28,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:29:28,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:29:28,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:29:28,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:29:28,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:29:28,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:29:28,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:29:28,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:29:28,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:29:28,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:29:28,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:29:28,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:29:28,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:29:28,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:29:28,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:29:28,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:29:28,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:29:28,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:29:28,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:29:28,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:29:28,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:29:28,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:29:28,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:29:28,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:29:28,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:29:28,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:29:28,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:29:28,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:29:28,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:29:28,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:29:28,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:29:28,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:29:28,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:29:28,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:29:28,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 09:29:28,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:29:28,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:29:28,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:29:28,308 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:29:28,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:29:28,309 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:29:28,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:29:28,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:29:28,310 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:29:28,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:29:28,311 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:29:28,311 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:29:28,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:29:28,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:29:28,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:29:28,312 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:29:28,312 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:29:28,312 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:29:28,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:29:28,313 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:29:28,313 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:29:28,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:29:28,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:29:28,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:29:28,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:29:28,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:29:28,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:29:28,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:29:28,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:29:28,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:29:28,315 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e [2022-11-20 09:29:28,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:29:28,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:29:28,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:29:28,631 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:29:28,631 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:29:28,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-20 09:29:31,736 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:29:32,106 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:29:32,110 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-20 09:29:32,132 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/data/85d850f47/4cea2549f31549339291474973164446/FLAGb047f1d9b [2022-11-20 09:29:32,153 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/data/85d850f47/4cea2549f31549339291474973164446 [2022-11-20 09:29:32,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:29:32,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:29:32,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:29:32,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:29:32,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:29:32,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:32,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d61bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32, skipping insertion in model container [2022-11-20 09:29:32,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:32,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:29:32,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:29:32,472 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-20 09:29:32,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:29:32,757 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:29:32,773 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-20 09:29:32,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:29:32,924 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:29:32,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32 WrapperNode [2022-11-20 09:29:32,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:29:32,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:29:32,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:29:32,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:29:32,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:32,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:33,006 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-20 09:29:33,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:29:33,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:29:33,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:29:33,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:29:33,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:33,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:33,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:33,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:33,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:33,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:33,050 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:33,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:33,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:29:33,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:29:33,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:29:33,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:29:33,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (1/1) ... [2022-11-20 09:29:33,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:29:33,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:29:33,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:29:33,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:29:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:29:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:29:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:29:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:29:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:29:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:29:33,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:29:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:29:33,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:29:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:29:33,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:29:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 09:29:33,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 09:29:33,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:29:33,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:29:33,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:29:33,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:29:33,142 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:29:33,355 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:29:33,357 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:29:33,793 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:29:33,987 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:29:33,987 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:29:33,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:29:33 BoogieIcfgContainer [2022-11-20 09:29:33,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:29:33,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:29:33,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:29:33,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:29:33,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:29:32" (1/3) ... [2022-11-20 09:29:34,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c53dc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:29:33, skipping insertion in model container [2022-11-20 09:29:34,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:32" (2/3) ... [2022-11-20 09:29:34,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c53dc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:29:34, skipping insertion in model container [2022-11-20 09:29:34,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:29:33" (3/3) ... [2022-11-20 09:29:34,004 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-20 09:29:34,024 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:29:34,024 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-20 09:29:34,024 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:29:34,119 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:29:34,164 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 09:29:34,184 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 316 flow [2022-11-20 09:29:34,186 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 316 flow [2022-11-20 09:29:34,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 316 flow [2022-11-20 09:29:34,265 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-20 09:29:34,265 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:29:34,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-20 09:29:34,274 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-20 09:29:40,093 INFO L134 LiptonReduction]: Checked pairs total: 10875 [2022-11-20 09:29:40,094 INFO L136 LiptonReduction]: Total number of compositions: 140 [2022-11-20 09:29:40,101 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-20 09:29:40,482 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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-11-20 09:29:40,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:29:40,507 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78d808f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:29:40,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-20 09:29:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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-11-20 09:29:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 09:29:40,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:40,534 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 09:29:40,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 623, now seen corresponding path program 1 times [2022-11-20 09:29:40,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:40,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370006912] [2022-11-20 09:29:40,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:40,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:40,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370006912] [2022-11-20 09:29:40,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370006912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:40,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:40,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 09:29:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637791985] [2022-11-20 09:29:40,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:40,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:29:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:40,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:29:40,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:29:40,714 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-11-20 09:29:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:41,002 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-20 09:29:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:29:41,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-20 09:29:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:41,079 INFO L225 Difference]: With dead ends: 6074 [2022-11-20 09:29:41,080 INFO L226 Difference]: Without dead ends: 6074 [2022-11-20 09:29:41,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:29:41,084 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:41,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:41,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-20 09:29:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-20 09:29:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 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-11-20 09:29:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-20 09:29:41,580 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-20 09:29:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:41,581 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-20 09:29:41,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-11-20 09:29:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-20 09:29:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:29:41,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:41,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:29:41,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:29:41,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash 611171, now seen corresponding path program 1 times [2022-11-20 09:29:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:41,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052576230] [2022-11-20 09:29:41,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:41,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:41,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:41,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052576230] [2022-11-20 09:29:41,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052576230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:41,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:41,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:41,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111087294] [2022-11-20 09:29:41,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:41,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:41,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:41,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:41,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:41,949 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-11-20 09:29:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:42,225 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-20 09:29:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:42,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2022-11-20 09:29:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:42,269 INFO L225 Difference]: With dead ends: 4962 [2022-11-20 09:29:42,274 INFO L226 Difference]: Without dead ends: 4812 [2022-11-20 09:29:42,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11-20 09:29:42,278 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:42,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-20 09:29:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-20 09:29:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 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-11-20 09:29:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-20 09:29:42,608 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-20 09:29:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:42,623 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-20 09:29:42,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-11-20 09:29:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-20 09:29:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:29:42,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:42,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:42,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:29:42,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:42,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:42,636 INFO L85 PathProgramCache]: Analyzing trace with hash 551069478, now seen corresponding path program 1 times [2022-11-20 09:29:42,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:42,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520259045] [2022-11-20 09:29:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:42,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:43,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:43,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520259045] [2022-11-20 09:29:43,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520259045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:43,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:43,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:29:43,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637491955] [2022-11-20 09:29:43,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:43,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:29:43,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:43,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:29:43,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:29:43,771 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-11-20 09:29:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:44,082 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2022-11-20 09:29:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:29:44,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-11-20 09:29:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:44,115 INFO L225 Difference]: With dead ends: 4062 [2022-11-20 09:29:44,115 INFO L226 Difference]: Without dead ends: 4062 [2022-11-20 09:29:44,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:29:44,116 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:44,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 40 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:29:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-11-20 09:29:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-11-20 09:29:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4061 states have (on average 3.9706968726914553) internal successors, (16125), 4061 states have internal predecessors, (16125), 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-11-20 09:29:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2022-11-20 09:29:44,343 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 12 [2022-11-20 09:29:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:44,345 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2022-11-20 09:29:44,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-11-20 09:29:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2022-11-20 09:29:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:29:44,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:44,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:44,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:29:44,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:44,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash 551069415, now seen corresponding path program 1 times [2022-11-20 09:29:44,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:44,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389861666] [2022-11-20 09:29:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:44,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389861666] [2022-11-20 09:29:44,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389861666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:44,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:44,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:44,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942588292] [2022-11-20 09:29:44,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:44,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:44,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:44,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:44,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:44,572 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-20 09:29:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:44,904 INFO L93 Difference]: Finished difference Result 8630 states and 33203 transitions. [2022-11-20 09:29:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:29:44,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-11-20 09:29:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:44,954 INFO L225 Difference]: With dead ends: 8630 [2022-11-20 09:29:44,954 INFO L226 Difference]: Without dead ends: 6554 [2022-11-20 09:29:44,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:44,957 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:44,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 18 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:29:44,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6554 states. [2022-11-20 09:29:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6554 to 5306. [2022-11-20 09:29:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5306 states, 5305 states have (on average 3.8554194156456174) internal successors, (20453), 5305 states have internal predecessors, (20453), 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-11-20 09:29:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5306 states to 5306 states and 20453 transitions. [2022-11-20 09:29:45,314 INFO L78 Accepts]: Start accepts. Automaton has 5306 states and 20453 transitions. Word has length 12 [2022-11-20 09:29:45,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:45,315 INFO L495 AbstractCegarLoop]: Abstraction has 5306 states and 20453 transitions. [2022-11-20 09:29:45,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-20 09:29:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5306 states and 20453 transitions. [2022-11-20 09:29:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:29:45,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:45,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:45,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:29:45,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:45,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash -974519426, now seen corresponding path program 1 times [2022-11-20 09:29:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:45,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984948128] [2022-11-20 09:29:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:45,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:45,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:45,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984948128] [2022-11-20 09:29:45,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984948128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:45,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:45,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:29:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412951969] [2022-11-20 09:29:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:45,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:29:45,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:45,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:29:45,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:45,501 INFO L87 Difference]: Start difference. First operand 5306 states and 20453 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11-20 09:29:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:45,854 INFO L93 Difference]: Finished difference Result 7592 states and 28147 transitions. [2022-11-20 09:29:45,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:29:45,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-11-20 09:29:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:45,998 INFO L225 Difference]: With dead ends: 7592 [2022-11-20 09:29:46,005 INFO L226 Difference]: Without dead ends: 6312 [2022-11-20 09:29:46,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:29:46,006 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:46,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 25 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:29:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6312 states. [2022-11-20 09:29:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6312 to 5100. [2022-11-20 09:29:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5100 states, 5099 states have (on average 3.834281231614042) internal successors, (19551), 5099 states have internal predecessors, (19551), 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-11-20 09:29:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5100 states to 5100 states and 19551 transitions. [2022-11-20 09:29:46,221 INFO L78 Accepts]: Start accepts. Automaton has 5100 states and 19551 transitions. Word has length 13 [2022-11-20 09:29:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:46,221 INFO L495 AbstractCegarLoop]: Abstraction has 5100 states and 19551 transitions. [2022-11-20 09:29:46,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11-20 09:29:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 5100 states and 19551 transitions. [2022-11-20 09:29:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:29:46,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:46,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:46,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:29:46,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:46,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:46,225 INFO L85 PathProgramCache]: Analyzing trace with hash -96749719, now seen corresponding path program 1 times [2022-11-20 09:29:46,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:46,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172612638] [2022-11-20 09:29:46,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:46,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:46,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:46,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172612638] [2022-11-20 09:29:46,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172612638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:46,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:46,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:29:46,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631686928] [2022-11-20 09:29:46,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:46,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:29:46,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:46,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:29:46,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:46,429 INFO L87 Difference]: Start difference. First operand 5100 states and 19551 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11-20 09:29:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:46,809 INFO L93 Difference]: Finished difference Result 7360 states and 27193 transitions. [2022-11-20 09:29:46,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:29:46,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-11-20 09:29:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:46,842 INFO L225 Difference]: With dead ends: 7360 [2022-11-20 09:29:46,842 INFO L226 Difference]: Without dead ends: 6154 [2022-11-20 09:29:46,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:29:46,844 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 69 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:46,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 19 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:29:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2022-11-20 09:29:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 4870. [2022-11-20 09:29:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4870 states, 4869 states have (on average 3.8233723557198602) internal successors, (18616), 4869 states have internal predecessors, (18616), 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-11-20 09:29:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 18616 transitions. [2022-11-20 09:29:47,032 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 18616 transitions. Word has length 13 [2022-11-20 09:29:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:47,032 INFO L495 AbstractCegarLoop]: Abstraction has 4870 states and 18616 transitions. [2022-11-20 09:29:47,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11-20 09:29:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 18616 transitions. [2022-11-20 09:29:47,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:29:47,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:47,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:47,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:29:47,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:47,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:47,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1488632835, now seen corresponding path program 1 times [2022-11-20 09:29:47,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:47,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823367193] [2022-11-20 09:29:47,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:47,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:47,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823367193] [2022-11-20 09:29:47,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823367193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:47,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:47,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:29:47,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727468775] [2022-11-20 09:29:47,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:47,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:29:47,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:47,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:29:47,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:47,391 INFO L87 Difference]: Start difference. First operand 4870 states and 18616 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11-20 09:29:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:47,682 INFO L93 Difference]: Finished difference Result 6487 states and 23881 transitions. [2022-11-20 09:29:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:29:47,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-11-20 09:29:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:47,714 INFO L225 Difference]: With dead ends: 6487 [2022-11-20 09:29:47,715 INFO L226 Difference]: Without dead ends: 5432 [2022-11-20 09:29:47,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:29:47,716 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 66 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:47,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 24 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:29:47,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5432 states. [2022-11-20 09:29:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5432 to 4112. [2022-11-20 09:29:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4112 states, 4111 states have (on average 3.7766966674774993) internal successors, (15526), 4111 states have internal predecessors, (15526), 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-11-20 09:29:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 15526 transitions. [2022-11-20 09:29:47,901 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 15526 transitions. Word has length 14 [2022-11-20 09:29:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:47,901 INFO L495 AbstractCegarLoop]: Abstraction has 4112 states and 15526 transitions. [2022-11-20 09:29:47,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11-20 09:29:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 15526 transitions. [2022-11-20 09:29:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:29:47,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:47,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:47,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:29:47,907 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1777385446, now seen corresponding path program 1 times [2022-11-20 09:29:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:47,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775713159] [2022-11-20 09:29:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:47,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:48,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:48,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775713159] [2022-11-20 09:29:48,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775713159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:48,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:48,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:48,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087547382] [2022-11-20 09:29:48,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:48,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:48,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:48,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:48,137 INFO L87 Difference]: Start difference. First operand 4112 states and 15526 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-11-20 09:29:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:48,299 INFO L93 Difference]: Finished difference Result 4508 states and 16703 transitions. [2022-11-20 09:29:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:29:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-11-20 09:29:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:48,319 INFO L225 Difference]: With dead ends: 4508 [2022-11-20 09:29:48,320 INFO L226 Difference]: Without dead ends: 4048 [2022-11-20 09:29:48,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:48,321 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 33 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:48,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 16 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2022-11-20 09:29:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 3976. [2022-11-20 09:29:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3976 states, 3975 states have (on average 3.759496855345912) internal successors, (14944), 3975 states have internal predecessors, (14944), 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-11-20 09:29:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 14944 transitions. [2022-11-20 09:29:48,437 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 14944 transitions. Word has length 15 [2022-11-20 09:29:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:48,438 INFO L495 AbstractCegarLoop]: Abstraction has 3976 states and 14944 transitions. [2022-11-20 09:29:48,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-11-20 09:29:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 14944 transitions. [2022-11-20 09:29:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:29:48,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:48,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:48,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:29:48,443 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1990817809, now seen corresponding path program 1 times [2022-11-20 09:29:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:48,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936178452] [2022-11-20 09:29:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:48,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:48,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936178452] [2022-11-20 09:29:48,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936178452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:48,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:48,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552695832] [2022-11-20 09:29:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:48,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:48,586 INFO L87 Difference]: Start difference. First operand 3976 states and 14944 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-11-20 09:29:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:48,685 INFO L93 Difference]: Finished difference Result 2884 states and 9616 transitions. [2022-11-20 09:29:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:48,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 16 [2022-11-20 09:29:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:48,698 INFO L225 Difference]: With dead ends: 2884 [2022-11-20 09:29:48,699 INFO L226 Difference]: Without dead ends: 2884 [2022-11-20 09:29:48,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-20 09:29:48,700 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:48,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2022-11-20 09:29:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2884. [2022-11-20 09:29:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2883 states have (on average 3.335414498785987) internal successors, (9616), 2883 states have internal predecessors, (9616), 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-11-20 09:29:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 9616 transitions. [2022-11-20 09:29:48,794 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 9616 transitions. Word has length 16 [2022-11-20 09:29:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:48,795 INFO L495 AbstractCegarLoop]: Abstraction has 2884 states and 9616 transitions. [2022-11-20 09:29:48,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-11-20 09:29:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 9616 transitions. [2022-11-20 09:29:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:29:48,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:48,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:48,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:29:48,803 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:48,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash 209553250, now seen corresponding path program 1 times [2022-11-20 09:29:48,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:48,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605104657] [2022-11-20 09:29:48,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:48,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:48,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:48,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605104657] [2022-11-20 09:29:48,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605104657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:48,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:48,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:29:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627736540] [2022-11-20 09:29:48,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:48,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:29:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:48,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:29:48,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:48,998 INFO L87 Difference]: Start difference. First operand 2884 states and 9616 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-11-20 09:29:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:49,284 INFO L93 Difference]: Finished difference Result 5396 states and 17467 transitions. [2022-11-20 09:29:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:29:49,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-11-20 09:29:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:49,302 INFO L225 Difference]: With dead ends: 5396 [2022-11-20 09:29:49,302 INFO L226 Difference]: Without dead ends: 3875 [2022-11-20 09:29:49,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:29:49,303 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:49,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 27 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:29:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2022-11-20 09:29:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 2670. [2022-11-20 09:29:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2669 states have (on average 3.24878231547396) internal successors, (8671), 2669 states have internal predecessors, (8671), 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-11-20 09:29:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 8671 transitions. [2022-11-20 09:29:49,391 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 8671 transitions. Word has length 18 [2022-11-20 09:29:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:49,391 INFO L495 AbstractCegarLoop]: Abstraction has 2670 states and 8671 transitions. [2022-11-20 09:29:49,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-11-20 09:29:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 8671 transitions. [2022-11-20 09:29:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 09:29:49,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:49,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:49,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:29:49,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:49,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash -276474409, now seen corresponding path program 1 times [2022-11-20 09:29:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:49,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500124963] [2022-11-20 09:29:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:49,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:49,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:49,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500124963] [2022-11-20 09:29:49,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500124963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:49,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:49,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:29:49,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108346584] [2022-11-20 09:29:49,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:49,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:49,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:49,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:49,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:49,563 INFO L87 Difference]: Start difference. First operand 2670 states and 8671 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-11-20 09:29:49,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:49,751 INFO L93 Difference]: Finished difference Result 4188 states and 13230 transitions. [2022-11-20 09:29:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:29:49,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2022-11-20 09:29:49,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:49,762 INFO L225 Difference]: With dead ends: 4188 [2022-11-20 09:29:49,763 INFO L226 Difference]: Without dead ends: 2808 [2022-11-20 09:29:49,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:49,763 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:49,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 22 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:29:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2022-11-20 09:29:49,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2478. [2022-11-20 09:29:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2477 states have (on average 3.1461445296729917) internal successors, (7793), 2477 states have internal predecessors, (7793), 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-11-20 09:29:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 7793 transitions. [2022-11-20 09:29:49,837 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 7793 transitions. Word has length 19 [2022-11-20 09:29:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:49,839 INFO L495 AbstractCegarLoop]: Abstraction has 2478 states and 7793 transitions. [2022-11-20 09:29:49,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-11-20 09:29:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 7793 transitions. [2022-11-20 09:29:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 09:29:49,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:49,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:49,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:29:49,847 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:49,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1342125902, now seen corresponding path program 1 times [2022-11-20 09:29:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:49,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565678013] [2022-11-20 09:29:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:49,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:50,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:50,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565678013] [2022-11-20 09:29:50,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565678013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:50,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:50,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:29:50,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198993544] [2022-11-20 09:29:50,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:50,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:50,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:50,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:50,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:50,083 INFO L87 Difference]: Start difference. First operand 2478 states and 7793 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-11-20 09:29:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:50,206 INFO L93 Difference]: Finished difference Result 1548 states and 4335 transitions. [2022-11-20 09:29:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:29:50,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-11-20 09:29:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:50,213 INFO L225 Difference]: With dead ends: 1548 [2022-11-20 09:29:50,213 INFO L226 Difference]: Without dead ends: 1542 [2022-11-20 09:29:50,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:50,215 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:50,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2022-11-20 09:29:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1536. [2022-11-20 09:29:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1535 states have (on average 2.801954397394137) internal successors, (4301), 1535 states have internal predecessors, (4301), 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-11-20 09:29:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 4301 transitions. [2022-11-20 09:29:50,263 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 4301 transitions. Word has length 19 [2022-11-20 09:29:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:50,264 INFO L495 AbstractCegarLoop]: Abstraction has 1536 states and 4301 transitions. [2022-11-20 09:29:50,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-11-20 09:29:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 4301 transitions. [2022-11-20 09:29:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 09:29:50,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:50,269 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] [2022-11-20 09:29:50,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:29:50,269 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash 532283377, now seen corresponding path program 1 times [2022-11-20 09:29:50,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:50,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113824047] [2022-11-20 09:29:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:50,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113824047] [2022-11-20 09:29:50,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113824047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:50,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:50,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:29:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849865226] [2022-11-20 09:29:50,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:50,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:29:50,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:50,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:29:50,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:50,638 INFO L87 Difference]: Start difference. First operand 1536 states and 4301 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-11-20 09:29:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:50,790 INFO L93 Difference]: Finished difference Result 1176 states and 3291 transitions. [2022-11-20 09:29:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:29:50,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-20 09:29:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:50,794 INFO L225 Difference]: With dead ends: 1176 [2022-11-20 09:29:50,794 INFO L226 Difference]: Without dead ends: 1067 [2022-11-20 09:29:50,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:50,795 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 89 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:50,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 16 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-11-20 09:29:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1040. [2022-11-20 09:29:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 1039 states have (on average 2.771896053897979) internal successors, (2880), 1039 states have internal predecessors, (2880), 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-11-20 09:29:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 2880 transitions. [2022-11-20 09:29:50,832 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 2880 transitions. Word has length 22 [2022-11-20 09:29:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:50,833 INFO L495 AbstractCegarLoop]: Abstraction has 1040 states and 2880 transitions. [2022-11-20 09:29:50,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-11-20 09:29:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 2880 transitions. [2022-11-20 09:29:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 09:29:50,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:50,837 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] [2022-11-20 09:29:50,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:29:50,838 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:50,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1471142747, now seen corresponding path program 1 times [2022-11-20 09:29:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:50,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796254512] [2022-11-20 09:29:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:51,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:51,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796254512] [2022-11-20 09:29:51,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796254512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:51,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:51,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:29:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201946972] [2022-11-20 09:29:51,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:51,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:51,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:51,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:51,134 INFO L87 Difference]: Start difference. First operand 1040 states and 2880 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-11-20 09:29:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:51,299 INFO L93 Difference]: Finished difference Result 1434 states and 3892 transitions. [2022-11-20 09:29:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:29:51,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2022-11-20 09:29:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:51,303 INFO L225 Difference]: With dead ends: 1434 [2022-11-20 09:29:51,303 INFO L226 Difference]: Without dead ends: 958 [2022-11-20 09:29:51,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:51,304 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:51,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 14 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-11-20 09:29:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 952. [2022-11-20 09:29:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 951 states have (on average 2.6961093585699265) internal successors, (2564), 951 states have internal predecessors, (2564), 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-11-20 09:29:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2564 transitions. [2022-11-20 09:29:51,335 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2564 transitions. Word has length 25 [2022-11-20 09:29:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:51,335 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 2564 transitions. [2022-11-20 09:29:51,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-11-20 09:29:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2564 transitions. [2022-11-20 09:29:51,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 09:29:51,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:51,340 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] [2022-11-20 09:29:51,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:29:51,341 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash -921806009, now seen corresponding path program 2 times [2022-11-20 09:29:51,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:51,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387768355] [2022-11-20 09:29:51,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:51,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:51,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:51,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387768355] [2022-11-20 09:29:51,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387768355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:51,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:51,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:29:51,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911977349] [2022-11-20 09:29:51,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:51,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:29:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:51,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:29:51,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:29:51,678 INFO L87 Difference]: Start difference. First operand 952 states and 2564 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 09:29:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:51,840 INFO L93 Difference]: Finished difference Result 892 states and 2450 transitions. [2022-11-20 09:29:51,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:29:51,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2022-11-20 09:29:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:51,842 INFO L225 Difference]: With dead ends: 892 [2022-11-20 09:29:51,842 INFO L226 Difference]: Without dead ends: 344 [2022-11-20 09:29:51,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:29:51,843 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 98 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:51,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 13 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:29:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-11-20 09:29:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2022-11-20 09:29:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.7434402332361514) internal successors, (941), 343 states have internal predecessors, (941), 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-11-20 09:29:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 941 transitions. [2022-11-20 09:29:51,855 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 941 transitions. Word has length 25 [2022-11-20 09:29:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:51,856 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 941 transitions. [2022-11-20 09:29:51,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 09:29:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 941 transitions. [2022-11-20 09:29:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 09:29:51,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:51,859 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] [2022-11-20 09:29:51,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:29:51,860 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:51,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -534726659, now seen corresponding path program 1 times [2022-11-20 09:29:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:51,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947222490] [2022-11-20 09:29:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:53,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:53,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947222490] [2022-11-20 09:29:53,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947222490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:53,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:53,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:29:53,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170451579] [2022-11-20 09:29:53,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:53,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:29:53,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:53,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:29:53,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:29:53,551 INFO L87 Difference]: Start difference. First operand 344 states and 941 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-11-20 09:29:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:54,084 INFO L93 Difference]: Finished difference Result 501 states and 1327 transitions. [2022-11-20 09:29:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:29:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2022-11-20 09:29:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:54,086 INFO L225 Difference]: With dead ends: 501 [2022-11-20 09:29:54,086 INFO L226 Difference]: Without dead ends: 282 [2022-11-20 09:29:54,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:29:54,087 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 102 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:54,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 32 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:29:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-20 09:29:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 242. [2022-11-20 09:29:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.5518672199170123) internal successors, (615), 241 states have internal predecessors, (615), 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-11-20 09:29:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 615 transitions. [2022-11-20 09:29:54,095 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 615 transitions. Word has length 29 [2022-11-20 09:29:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:54,095 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 615 transitions. [2022-11-20 09:29:54,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-11-20 09:29:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 615 transitions. [2022-11-20 09:29:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 09:29:54,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:54,097 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] [2022-11-20 09:29:54,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:29:54,097 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:54,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash 760427773, now seen corresponding path program 2 times [2022-11-20 09:29:54,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:54,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446088841] [2022-11-20 09:29:54,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:54,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:54,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446088841] [2022-11-20 09:29:54,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446088841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:54,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:54,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:29:54,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414492631] [2022-11-20 09:29:54,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:54,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:29:54,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:54,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:29:54,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:29:54,884 INFO L87 Difference]: Start difference. First operand 242 states and 615 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-11-20 09:29:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:55,161 INFO L93 Difference]: Finished difference Result 329 states and 822 transitions. [2022-11-20 09:29:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:29:55,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2022-11-20 09:29:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:55,163 INFO L225 Difference]: With dead ends: 329 [2022-11-20 09:29:55,163 INFO L226 Difference]: Without dead ends: 242 [2022-11-20 09:29:55,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:29:55,163 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 69 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:55,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 21 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:29:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-20 09:29:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-11-20 09:29:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.4522821576763487) internal successors, (591), 241 states have internal predecessors, (591), 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-11-20 09:29:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 591 transitions. [2022-11-20 09:29:55,169 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 591 transitions. Word has length 29 [2022-11-20 09:29:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:55,169 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 591 transitions. [2022-11-20 09:29:55,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-11-20 09:29:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 591 transitions. [2022-11-20 09:29:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 09:29:55,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:55,170 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] [2022-11-20 09:29:55,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:29:55,170 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:29:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1327948349, now seen corresponding path program 3 times [2022-11-20 09:29:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:55,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754166311] [2022-11-20 09:29:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:29:55,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:29:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:29:55,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:29:55,328 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:29:55,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-20 09:29:55,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-20 09:29:55,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-20 09:29:55,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-20 09:29:55,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-20 09:29:55,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-20 09:29:55,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-20 09:29:55,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-20 09:29:55,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-20 09:29:55,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-20 09:29:55,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-20 09:29:55,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-20 09:29:55,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-20 09:29:55,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-20 09:29:55,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-20 09:29:55,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-20 09:29:55,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 09:29:55,338 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:55,344 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:29:55,344 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:29:55,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:29:55 BasicIcfg [2022-11-20 09:29:55,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:29:55,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:29:55,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:29:55,510 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:29:55,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:29:33" (3/4) ... [2022-11-20 09:29:55,513 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:29:55,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:29:55,515 INFO L158 Benchmark]: Toolchain (without parser) took 23356.02ms. Allocated memory was 130.0MB in the beginning and 1.0GB in the end (delta: 908.1MB). Free memory was 99.4MB in the beginning and 544.3MB in the end (delta: -444.9MB). Peak memory consumption was 465.4MB. Max. memory is 16.1GB. [2022-11-20 09:29:55,515 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 107.0MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:29:55,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 762.82ms. Allocated memory is still 130.0MB. Free memory was 99.1MB in the beginning and 75.1MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 09:29:55,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.55ms. Allocated memory is still 130.0MB. Free memory was 75.1MB in the beginning and 72.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:29:55,516 INFO L158 Benchmark]: Boogie Preprocessor took 47.77ms. Allocated memory is still 130.0MB. Free memory was 72.6MB in the beginning and 70.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:29:55,517 INFO L158 Benchmark]: RCFGBuilder took 936.49ms. Allocated memory is still 130.0MB. Free memory was 70.5MB in the beginning and 75.4MB in the end (delta: -4.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2022-11-20 09:29:55,517 INFO L158 Benchmark]: TraceAbstraction took 21514.01ms. Allocated memory was 130.0MB in the beginning and 1.0GB in the end (delta: 908.1MB). Free memory was 74.8MB in the beginning and 545.3MB in the end (delta: -470.5MB). Peak memory consumption was 437.4MB. Max. memory is 16.1GB. [2022-11-20 09:29:55,517 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 1.0GB. Free memory was 545.3MB in the beginning and 544.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:29:55,519 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.25ms. Allocated memory is still 107.0MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 762.82ms. Allocated memory is still 130.0MB. Free memory was 99.1MB in the beginning and 75.1MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.55ms. Allocated memory is still 130.0MB. Free memory was 75.1MB in the beginning and 72.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.77ms. Allocated memory is still 130.0MB. Free memory was 72.6MB in the beginning and 70.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 936.49ms. Allocated memory is still 130.0MB. Free memory was 70.5MB in the beginning and 75.4MB in the end (delta: -4.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21514.01ms. Allocated memory was 130.0MB in the beginning and 1.0GB in the end (delta: 908.1MB). Free memory was 74.8MB in the beginning and 545.3MB in the end (delta: -470.5MB). Peak memory consumption was 437.4MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 1.0GB. Free memory was 545.3MB in the beginning and 544.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 159 PlacesBefore, 57 PlacesAfterwards, 148 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 140 TotalNumberOfCompositions, 10875 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5873, independent: 5640, independent conditional: 0, independent unconditional: 5640, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2880, independent: 2809, independent conditional: 0, independent unconditional: 2809, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2880, independent: 2781, independent conditional: 0, independent unconditional: 2781, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 99, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 482, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 444, dependent conditional: 0, dependent unconditional: 444, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5873, independent: 2831, independent conditional: 0, independent unconditional: 2831, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 2880, unknown conditional: 0, unknown unconditional: 2880] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 377, Positive conditional cache size: 0, Positive unconditional cache size: 377, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t801; [L863] FCALL, FORK 0 pthread_create(&t801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t801, ((void *)0), P0, ((void *)0))=-2, t801={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t802; [L865] FCALL, FORK 0 pthread_create(&t802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t802, ((void *)0), P1, ((void *)0))=-1, t801={5:0}, t802={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t803; [L867] FCALL, FORK 0 pthread_create(&t803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t803, ((void *)0), P2, ((void *)0))=0, t801={5:0}, t802={6:0}, t803={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t804; [L869] FCALL, FORK 0 pthread_create(&t804, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t804, ((void *)0), P3, ((void *)0))=1, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L821] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L840] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 866 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 866 mSDsluCounter, 319 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2170 IncrementalHoareTripleChecker+Invalid, 2267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 119 mSDtfsCounter, 2170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6448occurred in iteration=0, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 6750 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 2261 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 09:29:55,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:29:57,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:29:57,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:29:57,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:29:57,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:29:57,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:29:57,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:29:57,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:29:57,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:29:57,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:29:57,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:29:57,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:29:57,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:29:57,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:29:57,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:29:57,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:29:57,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:29:57,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:29:57,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:29:57,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:29:57,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:29:57,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:29:57,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:29:57,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:29:57,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:29:57,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:29:57,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:29:57,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:29:57,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:29:57,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:29:58,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:29:58,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:29:58,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:29:58,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:29:58,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:29:58,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:29:58,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:29:58,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:29:58,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:29:58,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:29:58,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:29:58,008 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 09:29:58,033 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:29:58,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:29:58,036 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:29:58,036 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:29:58,037 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:29:58,037 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:29:58,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:29:58,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:29:58,042 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:29:58,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:29:58,043 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:29:58,044 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:29:58,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:29:58,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:29:58,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:29:58,045 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:29:58,045 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:29:58,045 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:29:58,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:29:58,046 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:29:58,046 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 09:29:58,047 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 09:29:58,047 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:29:58,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:29:58,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:29:58,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:29:58,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:29:58,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:29:58,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:29:58,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:29:58,049 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 09:29:58,049 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 09:29:58,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 09:29:58,050 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e [2022-11-20 09:29:58,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:29:58,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:29:58,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:29:58,517 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:29:58,518 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:29:58,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-20 09:30:01,574 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:30:01,897 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:30:01,897 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-20 09:30:01,929 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/data/36008021b/19c6445764244054b1b36536bf7c5f74/FLAG572030b6f [2022-11-20 09:30:01,951 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/data/36008021b/19c6445764244054b1b36536bf7c5f74 [2022-11-20 09:30:01,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:30:01,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:30:01,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:30:01,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:30:01,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:30:01,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:01" (1/1) ... [2022-11-20 09:30:01,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e40c7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:01, skipping insertion in model container [2022-11-20 09:30:01,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:01" (1/1) ... [2022-11-20 09:30:01,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:30:02,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:30:02,236 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-20 09:30:02,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:30:02,559 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:30:02,575 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-20 09:30:02,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:30:02,690 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:30:02,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02 WrapperNode [2022-11-20 09:30:02,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:30:02,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:30:02,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:30:02,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:30:02,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (1/1) ... [2022-11-20 09:30:02,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (1/1) ... [2022-11-20 09:30:02,775 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-20 09:30:02,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:30:02,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:30:02,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:30:02,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:30:02,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (1/1) ... [2022-11-20 09:30:02,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (1/1) ... [2022-11-20 09:30:02,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (1/1) ... [2022-11-20 09:30:02,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (1/1) ... [2022-11-20 09:30:02,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (1/1) ... [2022-11-20 09:30:02,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (1/1) ... [2022-11-20 09:30:02,813 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (1/1) ... [2022-11-20 09:30:02,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (1/1) ... [2022-11-20 09:30:02,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:30:02,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:30:02,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:30:02,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:30:02,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (1/1) ... [2022-11-20 09:30:02,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:30:02,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:30:02,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:30:02,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:30:02,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:30:02,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:30:02,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:30:02,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:30:02,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 09:30:02,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 09:30:02,915 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:30:02,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:30:02,916 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:30:02,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:30:02,916 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:30:02,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:30:02,916 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 09:30:02,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 09:30:02,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:30:02,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:30:02,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:30:02,919 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:30:03,172 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:30:03,174 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:30:03,662 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:30:03,880 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:30:03,880 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:30:03,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:03 BoogieIcfgContainer [2022-11-20 09:30:03,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:30:03,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:30:03,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:30:03,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:30:03,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:30:01" (1/3) ... [2022-11-20 09:30:03,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba94a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:30:03, skipping insertion in model container [2022-11-20 09:30:03,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:02" (2/3) ... [2022-11-20 09:30:03,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba94a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:30:03, skipping insertion in model container [2022-11-20 09:30:03,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:03" (3/3) ... [2022-11-20 09:30:03,900 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-20 09:30:03,924 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:30:03,924 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-20 09:30:03,924 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:30:04,045 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:30:04,095 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 09:30:04,122 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-20 09:30:04,124 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-20 09:30:04,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-20 09:30:04,189 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-20 09:30:04,190 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:30:04,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-20 09:30:04,199 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-20 09:30:14,281 INFO L134 LiptonReduction]: Checked pairs total: 11184 [2022-11-20 09:30:14,282 INFO L136 LiptonReduction]: Total number of compositions: 139 [2022-11-20 09:30:14,296 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-20 09:30:14,644 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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-11-20 09:30:14,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:30:14,676 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45b1cf78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:30:14,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-20 09:30:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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-11-20 09:30:14,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 09:30:14,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:14,723 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 09:30:14,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:30:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:14,779 INFO L85 PathProgramCache]: Analyzing trace with hash 621, now seen corresponding path program 1 times [2022-11-20 09:30:14,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:14,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286072564] [2022-11-20 09:30:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:14,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:14,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:14,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:30:14,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 09:30:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:14,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 09:30:14,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:14,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:14,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:14,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286072564] [2022-11-20 09:30:14,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286072564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:14,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:14,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 09:30:14,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583277221] [2022-11-20 09:30:14,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:14,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:30:14,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:30:14,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:30:15,013 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 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) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-11-20 09:30:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:15,511 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-20 09:30:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:30:15,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-20 09:30:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:15,607 INFO L225 Difference]: With dead ends: 6074 [2022-11-20 09:30:15,608 INFO L226 Difference]: Without dead ends: 6074 [2022-11-20 09:30:15,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:30:15,613 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:15,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:30:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-20 09:30:16,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-20 09:30:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 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-11-20 09:30:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-20 09:30:16,090 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-20 09:30:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:16,091 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-20 09:30:16,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-11-20 09:30:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-20 09:30:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:30:16,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:16,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:30:16,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:16,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:16,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:30:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash 613229, now seen corresponding path program 1 times [2022-11-20 09:30:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:16,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84931354] [2022-11-20 09:30:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:16,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:16,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:16,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:30:16,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 09:30:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:16,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:30:16,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:16,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:16,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:16,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84931354] [2022-11-20 09:30:16,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84931354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:16,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:16,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:30:16,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892085762] [2022-11-20 09:30:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:16,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:16,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:16,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:16,476 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-11-20 09:30:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:16,768 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-20 09:30:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:16,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2022-11-20 09:30:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:16,810 INFO L225 Difference]: With dead ends: 4962 [2022-11-20 09:30:16,810 INFO L226 Difference]: Without dead ends: 4812 [2022-11-20 09:30:16,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-20 09:30:16,861 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:16,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:30:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-20 09:30:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-20 09:30:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 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-11-20 09:30:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-20 09:30:17,303 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-20 09:30:17,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:17,304 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-20 09:30:17,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-11-20 09:30:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-20 09:30:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:30:17,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:17,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:17,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:17,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:17,521 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:30:17,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:17,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1986122932, now seen corresponding path program 1 times [2022-11-20 09:30:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:17,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734170864] [2022-11-20 09:30:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:17,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:17,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:17,525 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:30:17,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 09:30:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:17,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:30:17,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:17,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:17,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:17,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734170864] [2022-11-20 09:30:17,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734170864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:17,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:17,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620935195] [2022-11-20 09:30:17,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:17,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:30:17,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:17,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:30:17,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:30:17,792 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-11-20 09:30:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:18,072 INFO L93 Difference]: Finished difference Result 3962 states and 14045 transitions. [2022-11-20 09:30:18,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:30:18,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-11-20 09:30:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:18,095 INFO L225 Difference]: With dead ends: 3962 [2022-11-20 09:30:18,095 INFO L226 Difference]: Without dead ends: 3212 [2022-11-20 09:30:18,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:30:18,097 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:18,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 20 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:30:18,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2022-11-20 09:30:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3212. [2022-11-20 09:30:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 3210 states have (on average 3.520249221183801) internal successors, (11300), 3211 states have internal predecessors, (11300), 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-11-20 09:30:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 11300 transitions. [2022-11-20 09:30:18,301 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 11300 transitions. Word has length 11 [2022-11-20 09:30:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:18,303 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 11300 transitions. [2022-11-20 09:30:18,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-11-20 09:30:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 11300 transitions. [2022-11-20 09:30:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:30:18,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:18,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:18,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:18,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:18,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:30:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash -151913892, now seen corresponding path program 1 times [2022-11-20 09:30:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:18,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323345436] [2022-11-20 09:30:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:18,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:18,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:18,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:30:18,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 09:30:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:18,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:30:18,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:18,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:18,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:18,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323345436] [2022-11-20 09:30:18,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323345436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:18,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:18,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:30:18,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631344121] [2022-11-20 09:30:18,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:18,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:30:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:18,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:30:18,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:30:18,735 INFO L87 Difference]: Start difference. First operand 3212 states and 11300 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-11-20 09:30:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:19,076 INFO L93 Difference]: Finished difference Result 2122 states and 6669 transitions. [2022-11-20 09:30:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:30:19,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-11-20 09:30:19,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:19,086 INFO L225 Difference]: With dead ends: 2122 [2022-11-20 09:30:19,086 INFO L226 Difference]: Without dead ends: 1692 [2022-11-20 09:30:19,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:30:19,087 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 64 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:19,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 36 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:30:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2022-11-20 09:30:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1692. [2022-11-20 09:30:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 3.088757396449704) internal successors, (5220), 1691 states have internal predecessors, (5220), 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-11-20 09:30:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 5220 transitions. [2022-11-20 09:30:19,156 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 5220 transitions. Word has length 15 [2022-11-20 09:30:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:19,156 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 5220 transitions. [2022-11-20 09:30:19,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-11-20 09:30:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 5220 transitions. [2022-11-20 09:30:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 09:30:19,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:19,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:19,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:19,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:19,373 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:30:19,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1341423536, now seen corresponding path program 1 times [2022-11-20 09:30:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:19,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465880246] [2022-11-20 09:30:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:19,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:19,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:19,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:30:19,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-20 09:30:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:19,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:30:19,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:19,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:19,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:19,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465880246] [2022-11-20 09:30:19,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465880246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:19,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:19,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:30:19,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19576233] [2022-11-20 09:30:19,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:19,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:30:19,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:19,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:30:19,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:30:19,623 INFO L87 Difference]: Start difference. First operand 1692 states and 5220 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-11-20 09:30:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:20,074 INFO L93 Difference]: Finished difference Result 1278 states and 3941 transitions. [2022-11-20 09:30:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:30:20,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-11-20 09:30:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:20,080 INFO L225 Difference]: With dead ends: 1278 [2022-11-20 09:30:20,080 INFO L226 Difference]: Without dead ends: 1152 [2022-11-20 09:30:20,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:30:20,081 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:20,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 64 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:30:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-11-20 09:30:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2022-11-20 09:30:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1150 states have (on average 3.130434782608696) internal successors, (3600), 1151 states have internal predecessors, (3600), 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-11-20 09:30:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3600 transitions. [2022-11-20 09:30:20,117 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3600 transitions. Word has length 19 [2022-11-20 09:30:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:20,118 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 3600 transitions. [2022-11-20 09:30:20,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-11-20 09:30:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3600 transitions. [2022-11-20 09:30:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 09:30:20,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:20,122 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] [2022-11-20 09:30:20,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:20,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:20,334 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:30:20,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:20,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1706142080, now seen corresponding path program 1 times [2022-11-20 09:30:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:20,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128535882] [2022-11-20 09:30:20,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:20,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:20,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:20,339 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:30:20,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-20 09:30:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:20,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 09:30:20,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:20,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:20,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:20,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128535882] [2022-11-20 09:30:20,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128535882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:20,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:20,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:30:20,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354258830] [2022-11-20 09:30:20,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:20,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:30:20,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:20,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:30:20,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:30:20,576 INFO L87 Difference]: Start difference. First operand 1152 states and 3600 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-11-20 09:30:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:21,105 INFO L93 Difference]: Finished difference Result 1085 states and 3464 transitions. [2022-11-20 09:30:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:30:21,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2022-11-20 09:30:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:21,110 INFO L225 Difference]: With dead ends: 1085 [2022-11-20 09:30:21,110 INFO L226 Difference]: Without dead ends: 1067 [2022-11-20 09:30:21,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:30:21,111 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 73 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:21,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 96 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:30:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-11-20 09:30:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2022-11-20 09:30:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1065 states have (on average 3.220657276995305) internal successors, (3430), 1066 states have internal predecessors, (3430), 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-11-20 09:30:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3430 transitions. [2022-11-20 09:30:21,144 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 3430 transitions. Word has length 23 [2022-11-20 09:30:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:21,144 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 3430 transitions. [2022-11-20 09:30:21,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-11-20 09:30:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 3430 transitions. [2022-11-20 09:30:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 09:30:21,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:21,148 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] [2022-11-20 09:30:21,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:21,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:21,361 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:30:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 908866261, now seen corresponding path program 1 times [2022-11-20 09:30:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:21,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752095034] [2022-11-20 09:30:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:21,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:21,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:21,364 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:30:21,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-20 09:30:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:21,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 09:30:21,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:21,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:21,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:21,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752095034] [2022-11-20 09:30:21,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752095034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:21,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:21,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:30:21,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214017756] [2022-11-20 09:30:21,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:21,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:30:21,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:21,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:30:21,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:30:21,861 INFO L87 Difference]: Start difference. First operand 1067 states and 3430 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-11-20 09:30:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:22,291 INFO L93 Difference]: Finished difference Result 1603 states and 4937 transitions. [2022-11-20 09:30:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:30:22,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2022-11-20 09:30:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:22,301 INFO L225 Difference]: With dead ends: 1603 [2022-11-20 09:30:22,302 INFO L226 Difference]: Without dead ends: 1603 [2022-11-20 09:30:22,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:30:22,303 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 82 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:22,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 39 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:30:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2022-11-20 09:30:22,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1419. [2022-11-20 09:30:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1417 states have (on average 3.1460832745236416) internal successors, (4458), 1418 states have internal predecessors, (4458), 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-11-20 09:30:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4458 transitions. [2022-11-20 09:30:22,355 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4458 transitions. Word has length 28 [2022-11-20 09:30:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:22,356 INFO L495 AbstractCegarLoop]: Abstraction has 1419 states and 4458 transitions. [2022-11-20 09:30:22,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-11-20 09:30:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4458 transitions. [2022-11-20 09:30:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 09:30:22,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:22,361 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] [2022-11-20 09:30:22,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:22,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:22,583 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:30:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1598034613, now seen corresponding path program 2 times [2022-11-20 09:30:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:22,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32593911] [2022-11-20 09:30:22,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:30:22,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:22,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:22,585 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:30:22,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-20 09:30:22,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 09:30:22,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:30:22,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:30:22,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:22,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:22,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:22,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32593911] [2022-11-20 09:30:22,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32593911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:22,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:22,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:30:22,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753524039] [2022-11-20 09:30:22,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:22,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:22,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:22,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:22,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:22,808 INFO L87 Difference]: Start difference. First operand 1419 states and 4458 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-11-20 09:30:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:22,941 INFO L93 Difference]: Finished difference Result 1970 states and 6096 transitions. [2022-11-20 09:30:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:22,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-11-20 09:30:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:22,950 INFO L225 Difference]: With dead ends: 1970 [2022-11-20 09:30:22,950 INFO L226 Difference]: Without dead ends: 1970 [2022-11-20 09:30:22,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:22,952 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:22,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:30:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2022-11-20 09:30:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1604. [2022-11-20 09:30:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1602 states have (on average 3.171660424469413) internal successors, (5081), 1603 states have internal predecessors, (5081), 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-11-20 09:30:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 5081 transitions. [2022-11-20 09:30:23,009 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 5081 transitions. Word has length 28 [2022-11-20 09:30:23,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:23,009 INFO L495 AbstractCegarLoop]: Abstraction has 1604 states and 5081 transitions. [2022-11-20 09:30:23,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-11-20 09:30:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 5081 transitions. [2022-11-20 09:30:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 09:30:23,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:23,016 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] [2022-11-20 09:30:23,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-20 09:30:23,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:23,230 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:30:23,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:23,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1934279845, now seen corresponding path program 3 times [2022-11-20 09:30:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:23,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178620094] [2022-11-20 09:30:23,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:30:23,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:23,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:23,233 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:30:23,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-20 09:30:23,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 09:30:23,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:30:23,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 09:30:23,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:23,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:23,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:23,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178620094] [2022-11-20 09:30:23,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178620094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:23,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:23,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:30:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513726163] [2022-11-20 09:30:23,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:23,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:30:23,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:30:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:30:23,858 INFO L87 Difference]: Start difference. First operand 1604 states and 5081 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-11-20 09:30:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:24,233 INFO L93 Difference]: Finished difference Result 1820 states and 5651 transitions. [2022-11-20 09:30:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:30:24,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-11-20 09:30:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:24,241 INFO L225 Difference]: With dead ends: 1820 [2022-11-20 09:30:24,241 INFO L226 Difference]: Without dead ends: 1820 [2022-11-20 09:30:24,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:30:24,242 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 87 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:24,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 37 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:30:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2022-11-20 09:30:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1384. [2022-11-20 09:30:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1382 states have (on average 3.1874095513748193) internal successors, (4405), 1383 states have internal predecessors, (4405), 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-11-20 09:30:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 4405 transitions. [2022-11-20 09:30:24,287 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 4405 transitions. Word has length 28 [2022-11-20 09:30:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:24,287 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 4405 transitions. [2022-11-20 09:30:24,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-11-20 09:30:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 4405 transitions. [2022-11-20 09:30:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 09:30:24,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:24,292 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] [2022-11-20 09:30:24,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:24,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:24,505 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 09:30:24,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash -671400743, now seen corresponding path program 4 times [2022-11-20 09:30:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:24,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695515162] [2022-11-20 09:30:24,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:30:24,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:24,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:24,507 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:30:24,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-20 09:30:24,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:30:24,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:30:24,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:24,881 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 09:30:24,881 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:30:24,883 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-20 09:30:24,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-20 09:30:24,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-20 09:30:24,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-20 09:30:24,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-20 09:30:24,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-20 09:30:24,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-20 09:30:24,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-20 09:30:24,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-20 09:30:24,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-20 09:30:24,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-20 09:30:24,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-20 09:30:24,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-20 09:30:24,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-20 09:30:24,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-20 09:30:24,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-20 09:30:24,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:25,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:30:25,127 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:25,133 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:30:25,133 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:30:25,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:30:25 BasicIcfg [2022-11-20 09:30:25,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:30:25,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:30:25,251 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:30:25,251 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:30:25,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:03" (3/4) ... [2022-11-20 09:30:25,255 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:30:25,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:30:25,256 INFO L158 Benchmark]: Toolchain (without parser) took 23291.66ms. Allocated memory was 81.8MB in the beginning and 394.3MB in the end (delta: 312.5MB). Free memory was 58.5MB in the beginning and 115.7MB in the end (delta: -57.2MB). Peak memory consumption was 257.5MB. Max. memory is 16.1GB. [2022-11-20 09:30:25,256 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 81.8MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:30:25,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.81ms. Allocated memory is still 81.8MB. Free memory was 58.2MB in the beginning and 57.1MB in the end (delta: 1.1MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2022-11-20 09:30:25,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.88ms. Allocated memory is still 81.8MB. Free memory was 57.1MB in the beginning and 54.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:30:25,257 INFO L158 Benchmark]: Boogie Preprocessor took 36.72ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 52.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:30:25,257 INFO L158 Benchmark]: RCFGBuilder took 1064.63ms. Allocated memory was 81.8MB in the beginning and 115.3MB in the end (delta: 33.6MB). Free memory was 52.4MB in the beginning and 66.4MB in the end (delta: -14.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-11-20 09:30:25,258 INFO L158 Benchmark]: TraceAbstraction took 21362.06ms. Allocated memory was 115.3MB in the beginning and 394.3MB in the end (delta: 278.9MB). Free memory was 65.9MB in the beginning and 116.7MB in the end (delta: -50.8MB). Peak memory consumption was 229.2MB. Max. memory is 16.1GB. [2022-11-20 09:30:25,258 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 394.3MB. Free memory was 116.7MB in the beginning and 115.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:30:25,260 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.26ms. Allocated memory is still 81.8MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 741.81ms. Allocated memory is still 81.8MB. Free memory was 58.2MB in the beginning and 57.1MB in the end (delta: 1.1MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.88ms. Allocated memory is still 81.8MB. Free memory was 57.1MB in the beginning and 54.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.72ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 52.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1064.63ms. Allocated memory was 81.8MB in the beginning and 115.3MB in the end (delta: 33.6MB). Free memory was 52.4MB in the beginning and 66.4MB in the end (delta: -14.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21362.06ms. Allocated memory was 115.3MB in the beginning and 394.3MB in the end (delta: 278.9MB). Free memory was 65.9MB in the beginning and 116.7MB in the end (delta: -50.8MB). Peak memory consumption was 229.2MB. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 394.3MB. Free memory was 116.7MB in the beginning and 115.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.2s, 160 PlacesBefore, 57 PlacesAfterwards, 149 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 139 TotalNumberOfCompositions, 11184 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5777, independent: 5530, independent conditional: 0, independent unconditional: 5530, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2880, independent: 2791, independent conditional: 0, independent unconditional: 2791, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2880, independent: 2756, independent conditional: 0, independent unconditional: 2756, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 124, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 547, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 460, dependent conditional: 0, dependent unconditional: 460, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5777, independent: 2739, independent conditional: 0, independent unconditional: 2739, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 2880, unknown conditional: 0, unknown unconditional: 2880] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t801; [L863] FCALL, FORK 0 pthread_create(&t801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t801, ((void *)0), P0, ((void *)0))=0, t801={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t802; [L865] FCALL, FORK 0 pthread_create(&t802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t802, ((void *)0), P1, ((void *)0))=1, t801={11:0}, t802={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L866] 0 pthread_t t803; [L867] FCALL, FORK 0 pthread_create(&t803, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t803, ((void *)0), P2, ((void *)0))=2, t801={11:0}, t802={15:0}, t803={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L868] 0 pthread_t t804; [L869] FCALL, FORK 0 pthread_create(&t804, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t804, ((void *)0), P3, ((void *)0))=3, t801={11:0}, t802={15:0}, t803={7:0}, t804={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L818] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L821] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] [L840] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t801={11:0}, t802={15:0}, t803={7:0}, t804={-2147483637:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 186 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 312 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1635 IncrementalHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 94 mSDtfsCounter, 1635 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6448occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 986 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 927 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1292 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 09:30:25,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a792058-94db-4108-80d8-bdbd753a93cc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample