./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_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_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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_33251d58-18bd-4a0a-8837-a6e4da0194bc/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 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e --- 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:32:32,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:32:32,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:32:32,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:32:32,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:32:32,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:32:32,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:32:32,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:32:32,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:32:32,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:32:32,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:32:32,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:32:32,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:32:32,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:32:32,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:32:32,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:32:32,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:32:32,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:32:32,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:32:32,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:32:32,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:32:32,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:32:32,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:32:32,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:32:32,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:32:32,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:32:32,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:32:32,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:32:32,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:32:32,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:32:32,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:32:32,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:32:32,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:32:32,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:32:32,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:32:32,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:32:32,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:32:32,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:32:32,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:32:33,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:32:33,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:32:33,003 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 09:32:33,050 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:32:33,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:32:33,052 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:32:33,052 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:32:33,053 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:32:33,053 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:32:33,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:32:33,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:32:33,054 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:32:33,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:32:33,056 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:32:33,056 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:32:33,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:32:33,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:32:33,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:32:33,057 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:32:33,057 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:32:33,058 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:32:33,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:32:33,058 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:32:33,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:32:33,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:32:33,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:32:33,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:32:33,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:32:33,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:32:33,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:32:33,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:32:33,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:32:33,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:32:33,061 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_33251d58-18bd-4a0a-8837-a6e4da0194bc/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_33251d58-18bd-4a0a-8837-a6e4da0194bc/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 -> 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e [2022-11-20 09:32:33,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:32:33,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:32:33,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:32:33,410 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:32:33,411 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:32:33,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2022-11-20 09:32:36,624 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:32:36,913 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:32:36,914 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2022-11-20 09:32:36,934 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/data/9cf2342b2/dbfc1949fbaa4fb78582a345f6af1c88/FLAGe852a509f [2022-11-20 09:32:36,949 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/data/9cf2342b2/dbfc1949fbaa4fb78582a345f6af1c88 [2022-11-20 09:32:36,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:32:36,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:32:36,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:32:36,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:32:36,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:32:36,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:32:36" (1/1) ... [2022-11-20 09:32:36,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297ab36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:36, skipping insertion in model container [2022-11-20 09:32:36,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:32:36" (1/1) ... [2022-11-20 09:32:36,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:32:37,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:32:37,204 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_33251d58-18bd-4a0a-8837-a6e4da0194bc/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i[993,1006] [2022-11-20 09:32:37,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:32:37,492 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:32:37,506 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_33251d58-18bd-4a0a-8837-a6e4da0194bc/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i[993,1006] [2022-11-20 09:32:37,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:32:37,590 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:32:37,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:37 WrapperNode [2022-11-20 09:32:37,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:32:37,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:32:37,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:32:37,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:32:37,601 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:32:37" (1/1) ... [2022-11-20 09:32:37,618 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:32:37" (1/1) ... [2022-11-20 09:32:37,643 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-11-20 09:32:37,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:32:37,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:32:37,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:32:37,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:32:37,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:37" (1/1) ... [2022-11-20 09:32:37,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:37" (1/1) ... [2022-11-20 09:32:37,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:37" (1/1) ... [2022-11-20 09:32:37,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:37" (1/1) ... [2022-11-20 09:32:37,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:37" (1/1) ... [2022-11-20 09:32:37,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:37" (1/1) ... [2022-11-20 09:32:37,707 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:37" (1/1) ... [2022-11-20 09:32:37,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:37" (1/1) ... [2022-11-20 09:32:37,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:32:37,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:32:37,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:32:37,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:32:37,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:37" (1/1) ... [2022-11-20 09:32:37,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:32:37,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:37,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:32:37,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:32:37,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:32:37,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:32:37,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:32:37,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:32:37,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:32:37,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:32:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:32:37,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:32:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:32:37,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:32:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:32:37,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:32:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:32:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:32:37,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:32:37,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:32:37,874 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:32:38,098 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:32:38,100 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:32:38,709 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:32:39,013 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:32:39,014 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:32:39,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:32:39 BoogieIcfgContainer [2022-11-20 09:32:39,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:32:39,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:32:39,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:32:39,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:32:39,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:32:36" (1/3) ... [2022-11-20 09:32:39,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf63fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:32:39, skipping insertion in model container [2022-11-20 09:32:39,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:37" (2/3) ... [2022-11-20 09:32:39,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf63fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:32:39, skipping insertion in model container [2022-11-20 09:32:39,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:32:39" (3/3) ... [2022-11-20 09:32:39,027 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_rmo.oepc.i [2022-11-20 09:32:39,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:32:39,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-20 09:32:39,050 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:32:39,188 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:32:39,236 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 09:32:39,251 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 166 transitions, 347 flow [2022-11-20 09:32:39,254 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 166 transitions, 347 flow [2022-11-20 09:32:39,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 166 transitions, 347 flow [2022-11-20 09:32:39,371 INFO L130 PetriNetUnfolder]: 2/163 cut-off events. [2022-11-20 09:32:39,371 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:32:39,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 163 events. 2/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 179 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-20 09:32:39,383 INFO L119 LiptonReduction]: Number of co-enabled transitions 4704 [2022-11-20 09:33:07,341 INFO L134 LiptonReduction]: Checked pairs total: 18051 [2022-11-20 09:33:07,342 INFO L136 LiptonReduction]: Total number of compositions: 158 [2022-11-20 09:33:07,357 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 60 transitions, 135 flow [2022-11-20 09:33:07,866 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10940 states, 10068 states have (on average 3.8646205800556217) internal successors, (38909), 10939 states have internal predecessors, (38909), 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:33:07,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:33:07,904 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;@63590778, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:33:07,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-11-20 09:33:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 10940 states, 10068 states have (on average 3.8646205800556217) internal successors, (38909), 10939 states have internal predecessors, (38909), 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:33:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 09:33:08,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:08,042 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 09:33:08,043 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash 831, now seen corresponding path program 1 times [2022-11-20 09:33:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:08,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995517328] [2022-11-20 09:33:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:08,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:08,241 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:33:08,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:08,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995517328] [2022-11-20 09:33:08,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995517328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:08,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:08,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 09:33:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173847409] [2022-11-20 09:33:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:08,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:33:08,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:33:08,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:33:08,311 INFO L87 Difference]: Start difference. First operand has 10940 states, 10068 states have (on average 3.8646205800556217) internal successors, (38909), 10939 states have internal predecessors, (38909), 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:33:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:08,577 INFO L93 Difference]: Finished difference Result 3308 states and 11165 transitions. [2022-11-20 09:33:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:33:08,582 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:33:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:08,635 INFO L225 Difference]: With dead ends: 3308 [2022-11-20 09:33:08,636 INFO L226 Difference]: Without dead ends: 3308 [2022-11-20 09:33:08,637 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:33:08,641 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:08,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:33:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2022-11-20 09:33:08,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3308. [2022-11-20 09:33:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3308 states, 3174 states have (on average 3.517643352236925) internal successors, (11165), 3307 states have internal predecessors, (11165), 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:33:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 11165 transitions. [2022-11-20 09:33:08,871 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 11165 transitions. Word has length 1 [2022-11-20 09:33:08,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:08,872 INFO L495 AbstractCegarLoop]: Abstraction has 3308 states and 11165 transitions. [2022-11-20 09:33:08,872 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:33:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 11165 transitions. [2022-11-20 09:33:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:33:08,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:08,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:33:08,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:33:08,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:08,875 INFO L85 PathProgramCache]: Analyzing trace with hash 820179, now seen corresponding path program 1 times [2022-11-20 09:33:08,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:08,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094859948] [2022-11-20 09:33:08,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:09,208 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:33:09,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:09,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094859948] [2022-11-20 09:33:09,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094859948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:09,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:09,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:33:09,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857524379] [2022-11-20 09:33:09,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:09,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:09,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:09,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:09,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:09,213 INFO L87 Difference]: Start difference. First operand 3308 states and 11165 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:33:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:09,498 INFO L93 Difference]: Finished difference Result 2549 states and 8024 transitions. [2022-11-20 09:33:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:09,499 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:33:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:09,522 INFO L225 Difference]: With dead ends: 2549 [2022-11-20 09:33:09,522 INFO L226 Difference]: Without dead ends: 2525 [2022-11-20 09:33:09,528 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:33:09,530 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:09,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 5 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2022-11-20 09:33:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2197. [2022-11-20 09:33:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2197 states, 2148 states have (on average 3.357541899441341) internal successors, (7212), 2196 states have internal predecessors, (7212), 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:33:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 7212 transitions. [2022-11-20 09:33:09,654 INFO L78 Accepts]: Start accepts. Automaton has 2197 states and 7212 transitions. Word has length 3 [2022-11-20 09:33:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:09,654 INFO L495 AbstractCegarLoop]: Abstraction has 2197 states and 7212 transitions. [2022-11-20 09:33:09,655 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:33:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 7212 transitions. [2022-11-20 09:33:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:33:09,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:09,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:33:09,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:33:09,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash 820180, now seen corresponding path program 1 times [2022-11-20 09:33:09,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:09,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112185997] [2022-11-20 09:33:09,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:09,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:09,863 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:33:09,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:09,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112185997] [2022-11-20 09:33:09,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112185997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:09,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:09,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:33:09,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192716458] [2022-11-20 09:33:09,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:09,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:09,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:09,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:09,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:09,866 INFO L87 Difference]: Start difference. First operand 2197 states and 7212 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:33:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:09,973 INFO L93 Difference]: Finished difference Result 1422 states and 4479 transitions. [2022-11-20 09:33:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:09,974 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:33:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:09,984 INFO L225 Difference]: With dead ends: 1422 [2022-11-20 09:33:09,984 INFO L226 Difference]: Without dead ends: 1398 [2022-11-20 09:33:09,985 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:33:09,986 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:09,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:33:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2022-11-20 09:33:10,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2022-11-20 09:33:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1380 states have (on average 3.21231884057971) internal successors, (4433), 1397 states have internal predecessors, (4433), 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:33:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 4433 transitions. [2022-11-20 09:33:10,072 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 4433 transitions. Word has length 3 [2022-11-20 09:33:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:10,073 INFO L495 AbstractCegarLoop]: Abstraction has 1398 states and 4433 transitions. [2022-11-20 09:33:10,073 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:33:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 4433 transitions. [2022-11-20 09:33:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 09:33:10,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:10,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:10,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:33:10,075 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:10,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:10,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1785885868, now seen corresponding path program 1 times [2022-11-20 09:33:10,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:10,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460970461] [2022-11-20 09:33:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:10,320 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:33:10,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:10,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460970461] [2022-11-20 09:33:10,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460970461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:10,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:10,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:33:10,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505827444] [2022-11-20 09:33:10,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:10,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:10,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:10,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:10,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:10,323 INFO L87 Difference]: Start difference. First operand 1398 states and 4433 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:33:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:10,509 INFO L93 Difference]: Finished difference Result 1358 states and 4291 transitions. [2022-11-20 09:33:10,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:10,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-11-20 09:33:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:10,521 INFO L225 Difference]: With dead ends: 1358 [2022-11-20 09:33:10,522 INFO L226 Difference]: Without dead ends: 1358 [2022-11-20 09:33:10,522 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:33:10,523 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:10,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-11-20 09:33:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1358. [2022-11-20 09:33:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1340 states have (on average 3.202238805970149) internal successors, (4291), 1357 states have internal predecessors, (4291), 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:33:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 4291 transitions. [2022-11-20 09:33:10,580 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 4291 transitions. Word has length 10 [2022-11-20 09:33:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:10,581 INFO L495 AbstractCegarLoop]: Abstraction has 1358 states and 4291 transitions. [2022-11-20 09:33:10,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:33:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 4291 transitions. [2022-11-20 09:33:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:33:10,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:10,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:10,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:33:10,584 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:10,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:10,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1951806792, now seen corresponding path program 1 times [2022-11-20 09:33:10,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:10,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663882037] [2022-11-20 09:33:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:10,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:10,871 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:33:10,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:10,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663882037] [2022-11-20 09:33:10,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663882037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:10,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:10,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:33:10,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628466224] [2022-11-20 09:33:10,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:10,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:33:10,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:10,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:33:10,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:33:10,879 INFO L87 Difference]: Start difference. First operand 1358 states and 4291 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:33:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:11,110 INFO L93 Difference]: Finished difference Result 1298 states and 4098 transitions. [2022-11-20 09:33:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:33:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:11,122 INFO L225 Difference]: With dead ends: 1298 [2022-11-20 09:33:11,122 INFO L226 Difference]: Without dead ends: 1298 [2022-11-20 09:33:11,123 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:33:11,123 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:11,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 10 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2022-11-20 09:33:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2022-11-20 09:33:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1281 states have (on average 3.199063231850117) internal successors, (4098), 1297 states have internal predecessors, (4098), 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:33:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 4098 transitions. [2022-11-20 09:33:11,176 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 4098 transitions. Word has length 11 [2022-11-20 09:33:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:11,177 INFO L495 AbstractCegarLoop]: Abstraction has 1298 states and 4098 transitions. [2022-11-20 09:33:11,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:33:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 4098 transitions. [2022-11-20 09:33:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:33:11,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:11,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:11,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:33:11,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:11,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:11,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1951806793, now seen corresponding path program 1 times [2022-11-20 09:33:11,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:11,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990586534] [2022-11-20 09:33:11,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:11,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:11,729 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:33:11,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:11,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990586534] [2022-11-20 09:33:11,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990586534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:11,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:11,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:33:11,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571540305] [2022-11-20 09:33:11,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:11,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:33:11,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:11,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:33:11,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:33:11,731 INFO L87 Difference]: Start difference. First operand 1298 states and 4098 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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:33:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:12,002 INFO L93 Difference]: Finished difference Result 1238 states and 3905 transitions. [2022-11-20 09:33:12,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:33:12,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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:33:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:12,013 INFO L225 Difference]: With dead ends: 1238 [2022-11-20 09:33:12,013 INFO L226 Difference]: Without dead ends: 1238 [2022-11-20 09:33:12,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:33:12,015 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:12,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 12 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-11-20 09:33:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2022-11-20 09:33:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1222 states have (on average 3.195581014729951) internal successors, (3905), 1237 states have internal predecessors, (3905), 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:33:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 3905 transitions. [2022-11-20 09:33:12,066 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 3905 transitions. Word has length 11 [2022-11-20 09:33:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:12,066 INFO L495 AbstractCegarLoop]: Abstraction has 1238 states and 3905 transitions. [2022-11-20 09:33:12,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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:33:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 3905 transitions. [2022-11-20 09:33:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:33:12,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:12,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:12,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:33:12,068 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:12,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash -472118181, now seen corresponding path program 1 times [2022-11-20 09:33:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:12,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847255701] [2022-11-20 09:33:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:12,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:12,371 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:33:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:12,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847255701] [2022-11-20 09:33:12,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847255701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:12,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:12,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:12,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810982666] [2022-11-20 09:33:12,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:12,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:33:12,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:12,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:33:12,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:33:12,375 INFO L87 Difference]: Start difference. First operand 1238 states and 3905 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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:33:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:12,505 INFO L93 Difference]: Finished difference Result 1222 states and 3849 transitions. [2022-11-20 09:33:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:12,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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:33:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:12,515 INFO L225 Difference]: With dead ends: 1222 [2022-11-20 09:33:12,516 INFO L226 Difference]: Without dead ends: 1222 [2022-11-20 09:33:12,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:33:12,517 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:12,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 10 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:33:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2022-11-20 09:33:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2022-11-20 09:33:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1206 states have (on average 3.191542288557214) internal successors, (3849), 1221 states have internal predecessors, (3849), 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:33:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3849 transitions. [2022-11-20 09:33:12,568 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3849 transitions. Word has length 11 [2022-11-20 09:33:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:12,569 INFO L495 AbstractCegarLoop]: Abstraction has 1222 states and 3849 transitions. [2022-11-20 09:33:12,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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:33:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3849 transitions. [2022-11-20 09:33:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:33:12,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:12,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:12,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:33:12,577 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1750761632, now seen corresponding path program 1 times [2022-11-20 09:33:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:12,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090445457] [2022-11-20 09:33:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:12,911 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:33:12,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:12,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090445457] [2022-11-20 09:33:12,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090445457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:12,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:12,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:12,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760043485] [2022-11-20 09:33:12,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:12,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:33:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:12,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:33:12,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:33:12,915 INFO L87 Difference]: Start difference. First operand 1222 states and 3849 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:33:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:13,110 INFO L93 Difference]: Finished difference Result 1206 states and 3793 transitions. [2022-11-20 09:33:13,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:13,110 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:33:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:13,120 INFO L225 Difference]: With dead ends: 1206 [2022-11-20 09:33:13,120 INFO L226 Difference]: Without dead ends: 1206 [2022-11-20 09:33:13,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:33:13,121 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:13,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 18 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:13,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2022-11-20 09:33:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1206. [2022-11-20 09:33:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1190 states have (on average 3.187394957983193) internal successors, (3793), 1205 states have internal predecessors, (3793), 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:33:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 3793 transitions. [2022-11-20 09:33:13,167 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 3793 transitions. Word has length 12 [2022-11-20 09:33:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:13,168 INFO L495 AbstractCegarLoop]: Abstraction has 1206 states and 3793 transitions. [2022-11-20 09:33:13,168 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:33:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 3793 transitions. [2022-11-20 09:33:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:33:13,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:13,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:13,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:33:13,172 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:13,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:13,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1214543620, now seen corresponding path program 1 times [2022-11-20 09:33:13,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:13,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469492465] [2022-11-20 09:33:13,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:13,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:15,405 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:33:15,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:15,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469492465] [2022-11-20 09:33:15,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469492465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:15,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:15,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:33:15,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8006654] [2022-11-20 09:33:15,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:15,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:33:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:15,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:33:15,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:33:15,407 INFO L87 Difference]: Start difference. First operand 1206 states and 3793 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:33:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:15,984 INFO L93 Difference]: Finished difference Result 1488 states and 4662 transitions. [2022-11-20 09:33:15,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:33:15,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:33:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:16,014 INFO L225 Difference]: With dead ends: 1488 [2022-11-20 09:33:16,015 INFO L226 Difference]: Without dead ends: 1488 [2022-11-20 09:33:16,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:33:16,016 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 75 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:16,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 25 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:33:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-11-20 09:33:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1320. [2022-11-20 09:33:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1304 states have (on average 3.1717791411042944) internal successors, (4136), 1319 states have internal predecessors, (4136), 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:33:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 4136 transitions. [2022-11-20 09:33:16,092 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 4136 transitions. Word has length 13 [2022-11-20 09:33:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:16,093 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 4136 transitions. [2022-11-20 09:33:16,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:33:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 4136 transitions. [2022-11-20 09:33:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:33:16,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:16,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:16,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:33:16,096 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1462033892, now seen corresponding path program 2 times [2022-11-20 09:33:16,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:16,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914853262] [2022-11-20 09:33:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:16,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:18,174 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:33:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:18,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914853262] [2022-11-20 09:33:18,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914853262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:18,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:18,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:33:18,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138482180] [2022-11-20 09:33:18,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:18,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:33:18,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:18,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:33:18,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:33:18,177 INFO L87 Difference]: Start difference. First operand 1320 states and 4136 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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:33:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:18,930 INFO L93 Difference]: Finished difference Result 1584 states and 4966 transitions. [2022-11-20 09:33:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:33:18,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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:33:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:18,940 INFO L225 Difference]: With dead ends: 1584 [2022-11-20 09:33:18,940 INFO L226 Difference]: Without dead ends: 1584 [2022-11-20 09:33:18,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:33:18,942 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 111 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:18,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 25 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:33:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2022-11-20 09:33:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1302. [2022-11-20 09:33:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1286 states have (on average 3.185847589424572) internal successors, (4097), 1301 states have internal predecessors, (4097), 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:33:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 4097 transitions. [2022-11-20 09:33:19,000 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 4097 transitions. Word has length 13 [2022-11-20 09:33:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:19,001 INFO L495 AbstractCegarLoop]: Abstraction has 1302 states and 4097 transitions. [2022-11-20 09:33:19,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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:33:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 4097 transitions. [2022-11-20 09:33:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:33:19,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:19,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:19,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:33:19,003 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1116532654, now seen corresponding path program 3 times [2022-11-20 09:33:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:19,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833617846] [2022-11-20 09:33:19,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:19,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:19,246 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:33:19,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:19,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833617846] [2022-11-20 09:33:19,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833617846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:19,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:19,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:19,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27363246] [2022-11-20 09:33:19,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:19,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:33:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:33:19,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:33:19,250 INFO L87 Difference]: Start difference. First operand 1302 states and 4097 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:33:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:19,466 INFO L93 Difference]: Finished difference Result 1754 states and 5403 transitions. [2022-11-20 09:33:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:33:19,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:33:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:19,475 INFO L225 Difference]: With dead ends: 1754 [2022-11-20 09:33:19,476 INFO L226 Difference]: Without dead ends: 1754 [2022-11-20 09:33:19,476 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:33:19,477 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:19,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 15 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2022-11-20 09:33:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1356. [2022-11-20 09:33:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1340 states have (on average 3.1619402985074627) internal successors, (4237), 1355 states have internal predecessors, (4237), 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:33:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 4237 transitions. [2022-11-20 09:33:19,526 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 4237 transitions. Word has length 13 [2022-11-20 09:33:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:19,526 INFO L495 AbstractCegarLoop]: Abstraction has 1356 states and 4237 transitions. [2022-11-20 09:33:19,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:33:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 4237 transitions. [2022-11-20 09:33:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:33:19,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:19,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:19,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:33:19,529 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:19,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:19,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1560976110, now seen corresponding path program 1 times [2022-11-20 09:33:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:19,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144436931] [2022-11-20 09:33:19,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:19,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:19,710 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:33:19,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:19,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144436931] [2022-11-20 09:33:19,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144436931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:19,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:19,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:33:19,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299858791] [2022-11-20 09:33:19,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:19,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:33:19,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:19,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:33:19,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:33:19,714 INFO L87 Difference]: Start difference. First operand 1356 states and 4237 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:33:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:19,919 INFO L93 Difference]: Finished difference Result 1452 states and 4329 transitions. [2022-11-20 09:33:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:33:19,920 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:33:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:19,927 INFO L225 Difference]: With dead ends: 1452 [2022-11-20 09:33:19,927 INFO L226 Difference]: Without dead ends: 1452 [2022-11-20 09:33:19,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:33:19,928 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:19,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 7 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2022-11-20 09:33:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1224. [2022-11-20 09:33:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1208 states have (on average 3.127483443708609) internal successors, (3778), 1223 states have internal predecessors, (3778), 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:33:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 3778 transitions. [2022-11-20 09:33:19,973 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 3778 transitions. Word has length 13 [2022-11-20 09:33:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:19,973 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 3778 transitions. [2022-11-20 09:33:19,974 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:33:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 3778 transitions. [2022-11-20 09:33:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:33:19,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:19,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:19,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:33:19,977 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:19,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1145620313, now seen corresponding path program 1 times [2022-11-20 09:33:19,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:19,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427623013] [2022-11-20 09:33:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:19,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:20,536 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:33:20,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:20,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427623013] [2022-11-20 09:33:20,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427623013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:20,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:20,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:33:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174305965] [2022-11-20 09:33:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:20,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:33:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:20,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:33:20,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:33:20,539 INFO L87 Difference]: Start difference. First operand 1224 states and 3778 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:33:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:20,926 INFO L93 Difference]: Finished difference Result 1252 states and 3567 transitions. [2022-11-20 09:33:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:33:20,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:33:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:20,933 INFO L225 Difference]: With dead ends: 1252 [2022-11-20 09:33:20,933 INFO L226 Difference]: Without dead ends: 1252 [2022-11-20 09:33:20,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:33:20,934 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 106 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:20,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 20 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:33:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-11-20 09:33:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1092. [2022-11-20 09:33:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1076 states have (on average 2.9618959107806693) internal successors, (3187), 1091 states have internal predecessors, (3187), 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:33:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 3187 transitions. [2022-11-20 09:33:20,979 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 3187 transitions. Word has length 14 [2022-11-20 09:33:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:20,982 INFO L495 AbstractCegarLoop]: Abstraction has 1092 states and 3187 transitions. [2022-11-20 09:33:20,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:33:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 3187 transitions. [2022-11-20 09:33:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:33:20,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:20,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:20,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:33:20,985 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:20,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:20,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1145620364, now seen corresponding path program 1 times [2022-11-20 09:33:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:20,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656036098] [2022-11-20 09:33:20,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:20,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:21,680 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:33:21,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:21,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656036098] [2022-11-20 09:33:21,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656036098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:21,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:21,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:33:21,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211730157] [2022-11-20 09:33:21,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:21,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:33:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:21,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:33:21,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:33:21,682 INFO L87 Difference]: Start difference. First operand 1092 states and 3187 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:33:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:22,315 INFO L93 Difference]: Finished difference Result 880 states and 2596 transitions. [2022-11-20 09:33:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:33:22,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:33:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:22,320 INFO L225 Difference]: With dead ends: 880 [2022-11-20 09:33:22,320 INFO L226 Difference]: Without dead ends: 736 [2022-11-20 09:33:22,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:33:22,321 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:22,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 55 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:33:22,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-11-20 09:33:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2022-11-20 09:33:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 728 states have (on average 2.840659340659341) internal successors, (2068), 735 states have internal predecessors, (2068), 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:33:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 2068 transitions. [2022-11-20 09:33:22,344 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 2068 transitions. Word has length 14 [2022-11-20 09:33:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:22,344 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 2068 transitions. [2022-11-20 09:33:22,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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:33:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 2068 transitions. [2022-11-20 09:33:22,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:33:22,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:22,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:22,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:33:22,347 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:22,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1078967562, now seen corresponding path program 1 times [2022-11-20 09:33:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:22,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449480408] [2022-11-20 09:33:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:23,758 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:33:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:23,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449480408] [2022-11-20 09:33:23,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449480408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:23,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:23,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:33:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832580543] [2022-11-20 09:33:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:23,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:33:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:33:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:33:23,760 INFO L87 Difference]: Start difference. First operand 736 states and 2068 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:33:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:24,433 INFO L93 Difference]: Finished difference Result 742 states and 2066 transitions. [2022-11-20 09:33:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:33:24,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:33:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:24,437 INFO L225 Difference]: With dead ends: 742 [2022-11-20 09:33:24,437 INFO L226 Difference]: Without dead ends: 742 [2022-11-20 09:33:24,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:33:24,438 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 90 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:24,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 25 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:33:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-11-20 09:33:24,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 652. [2022-11-20 09:33:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 644 states have (on average 2.812111801242236) internal successors, (1811), 651 states have internal predecessors, (1811), 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:33:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1811 transitions. [2022-11-20 09:33:24,462 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1811 transitions. Word has length 15 [2022-11-20 09:33:24,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:24,462 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 1811 transitions. [2022-11-20 09:33:24,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:33:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1811 transitions. [2022-11-20 09:33:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:33:24,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:24,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:24,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:33:24,465 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1154494819, now seen corresponding path program 1 times [2022-11-20 09:33:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:24,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932048428] [2022-11-20 09:33:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:24,566 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:33:24,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:24,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932048428] [2022-11-20 09:33:24,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932048428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:24,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:24,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:24,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810322630] [2022-11-20 09:33:24,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:24,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:33:24,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:24,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:33:24,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:33:24,569 INFO L87 Difference]: Start difference. First operand 652 states and 1811 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:33:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:24,686 INFO L93 Difference]: Finished difference Result 664 states and 1888 transitions. [2022-11-20 09:33:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:33:24,686 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:33:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:24,688 INFO L225 Difference]: With dead ends: 664 [2022-11-20 09:33:24,688 INFO L226 Difference]: Without dead ends: 224 [2022-11-20 09:33:24,688 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:33:24,689 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 41 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:24,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:33:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-20 09:33:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-11-20 09:33:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.591928251121076) internal successors, (578), 223 states have internal predecessors, (578), 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:33:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 578 transitions. [2022-11-20 09:33:24,698 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 578 transitions. Word has length 15 [2022-11-20 09:33:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:24,698 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 578 transitions. [2022-11-20 09:33:24,699 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:33:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 578 transitions. [2022-11-20 09:33:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:33:24,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:24,700 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:33:24,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:33:24,700 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:24,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1802788491, now seen corresponding path program 1 times [2022-11-20 09:33:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:24,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36620889] [2022-11-20 09:33:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:24,922 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:33:24,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:24,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36620889] [2022-11-20 09:33:24,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36620889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:24,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:24,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049912346] [2022-11-20 09:33:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:24,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:24,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:24,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:24,925 INFO L87 Difference]: Start difference. First operand 224 states and 578 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:33:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:25,003 INFO L93 Difference]: Finished difference Result 184 states and 430 transitions. [2022-11-20 09:33:25,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:25,004 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:33:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:25,005 INFO L225 Difference]: With dead ends: 184 [2022-11-20 09:33:25,005 INFO L226 Difference]: Without dead ends: 184 [2022-11-20 09:33:25,005 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:33:25,006 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:25,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:33:25,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-20 09:33:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-11-20 09:33:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.349726775956284) internal successors, (430), 183 states have internal predecessors, (430), 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:33:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 430 transitions. [2022-11-20 09:33:25,012 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 430 transitions. Word has length 16 [2022-11-20 09:33:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:25,013 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 430 transitions. [2022-11-20 09:33:25,013 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:33:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 430 transitions. [2022-11-20 09:33:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 09:33:25,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:25,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:25,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:33:25,015 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:25,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:25,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1690362331, now seen corresponding path program 1 times [2022-11-20 09:33:25,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:25,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272426655] [2022-11-20 09:33:25,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:25,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:25,246 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:33:25,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:25,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272426655] [2022-11-20 09:33:25,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272426655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:25,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:25,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:33:25,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143306085] [2022-11-20 09:33:25,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:25,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:33:25,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:25,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:33:25,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:33:25,249 INFO L87 Difference]: Start difference. First operand 184 states and 430 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:33:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:25,360 INFO L93 Difference]: Finished difference Result 134 states and 284 transitions. [2022-11-20 09:33:25,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:33:25,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-11-20 09:33:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:25,361 INFO L225 Difference]: With dead ends: 134 [2022-11-20 09:33:25,361 INFO L226 Difference]: Without dead ends: 134 [2022-11-20 09:33:25,362 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:33:25,362 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:25,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 13 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:33:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-20 09:33:25,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-11-20 09:33:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.1353383458646618) internal successors, (284), 133 states have internal predecessors, (284), 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:33:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 284 transitions. [2022-11-20 09:33:25,367 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 284 transitions. Word has length 17 [2022-11-20 09:33:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:25,367 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 284 transitions. [2022-11-20 09:33:25,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:33:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 284 transitions. [2022-11-20 09:33:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 09:33:25,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:25,368 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:33:25,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 09:33:25,368 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:25,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash 951596256, now seen corresponding path program 1 times [2022-11-20 09:33:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:25,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569201114] [2022-11-20 09:33:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:25,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:25,775 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:33:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:25,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569201114] [2022-11-20 09:33:25,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569201114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:25,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:25,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:33:25,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831506836] [2022-11-20 09:33:25,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:25,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:33:25,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:33:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:33:25,777 INFO L87 Difference]: Start difference. First operand 134 states and 284 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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:33:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:26,008 INFO L93 Difference]: Finished difference Result 190 states and 389 transitions. [2022-11-20 09:33:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:33:26,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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:33:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:26,010 INFO L225 Difference]: With dead ends: 190 [2022-11-20 09:33:26,010 INFO L226 Difference]: Without dead ends: 136 [2022-11-20 09:33:26,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:33:26,011 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 74 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:26,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 4 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-20 09:33:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2022-11-20 09:33:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.9699248120300752) internal successors, (262), 133 states have internal predecessors, (262), 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:33:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 262 transitions. [2022-11-20 09:33:26,016 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 262 transitions. Word has length 19 [2022-11-20 09:33:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:26,017 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 262 transitions. [2022-11-20 09:33:26,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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:33:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 262 transitions. [2022-11-20 09:33:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 09:33:26,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:26,018 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:33:26,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 09:33:26,020 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:26,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1440646312, now seen corresponding path program 1 times [2022-11-20 09:33:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:26,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694468050] [2022-11-20 09:33:26,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:26,355 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:33:26,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:26,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694468050] [2022-11-20 09:33:26,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694468050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:26,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:26,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:33:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368906415] [2022-11-20 09:33:26,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:26,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:33:26,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:26,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:33:26,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:33:26,358 INFO L87 Difference]: Start difference. First operand 134 states and 262 transitions. Second operand has 5 states, 5 states have (on average 3.8) 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:33:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:26,483 INFO L93 Difference]: Finished difference Result 113 states and 222 transitions. [2022-11-20 09:33:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:33:26,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) 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:33:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:26,485 INFO L225 Difference]: With dead ends: 113 [2022-11-20 09:33:26,485 INFO L226 Difference]: Without dead ends: 73 [2022-11-20 09:33:26,485 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:33:26,486 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:26,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 11 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:33:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-20 09:33:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-20 09:33:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 72 states have internal predecessors, (136), 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:33:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 136 transitions. [2022-11-20 09:33:26,489 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 136 transitions. Word has length 19 [2022-11-20 09:33:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:26,489 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 136 transitions. [2022-11-20 09:33:26,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) 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:33:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 136 transitions. [2022-11-20 09:33:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:33:26,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:26,490 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] [2022-11-20 09:33:26,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 09:33:26,491 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:33:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:26,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1730164297, now seen corresponding path program 1 times [2022-11-20 09:33:26,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:26,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989502756] [2022-11-20 09:33:26,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:33:26,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:33:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:33:26,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:33:26,716 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:33:26,719 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2022-11-20 09:33:26,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2022-11-20 09:33:26,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2022-11-20 09:33:26,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2022-11-20 09:33:26,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2022-11-20 09:33:26,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2022-11-20 09:33:26,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2022-11-20 09:33:26,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2022-11-20 09:33:26,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2022-11-20 09:33:26,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2022-11-20 09:33:26,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2022-11-20 09:33:26,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2022-11-20 09:33:26,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2022-11-20 09:33:26,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2022-11-20 09:33:26,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2022-11-20 09:33:26,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2022-11-20 09:33:26,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2022-11-20 09:33:26,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2022-11-20 09:33:26,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2022-11-20 09:33:26,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2022-11-20 09:33:26,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2022-11-20 09:33:26,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2022-11-20 09:33:26,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2022-11-20 09:33:26,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2022-11-20 09:33:26,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2022-11-20 09:33:26,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2022-11-20 09:33:26,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2022-11-20 09:33:26,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2022-11-20 09:33:26,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2022-11-20 09:33:26,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2022-11-20 09:33:26,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2022-11-20 09:33:26,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2022-11-20 09:33:26,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2022-11-20 09:33:26,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2022-11-20 09:33:26,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2022-11-20 09:33:26,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2022-11-20 09:33:26,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2022-11-20 09:33:26,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2022-11-20 09:33:26,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2022-11-20 09:33:26,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2022-11-20 09:33:26,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2022-11-20 09:33:26,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2022-11-20 09:33:26,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2022-11-20 09:33:26,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2022-11-20 09:33:26,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2022-11-20 09:33:26,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2022-11-20 09:33:26,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2022-11-20 09:33:26,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2022-11-20 09:33:26,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2022-11-20 09:33:26,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2022-11-20 09:33:26,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2022-11-20 09:33:26,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2022-11-20 09:33:26,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2022-11-20 09:33:26,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 09:33:26,735 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:26,743 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:33:26,743 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:33:26,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:33:26 BasicIcfg [2022-11-20 09:33:26,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:33:26,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:33:26,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:33:26,858 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:33:26,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:32:39" (3/4) ... [2022-11-20 09:33:26,861 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:33:26,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:33:26,862 INFO L158 Benchmark]: Toolchain (without parser) took 49908.47ms. Allocated memory was 121.6MB in the beginning and 390.1MB in the end (delta: 268.4MB). Free memory was 77.3MB in the beginning and 300.9MB in the end (delta: -223.6MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2022-11-20 09:33:26,862 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:33:26,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.88ms. Allocated memory is still 121.6MB. Free memory was 76.9MB in the beginning and 54.2MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 09:33:26,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.81ms. Allocated memory is still 121.6MB. Free memory was 54.2MB in the beginning and 51.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:33:26,863 INFO L158 Benchmark]: Boogie Preprocessor took 83.73ms. Allocated memory is still 121.6MB. Free memory was 51.7MB in the beginning and 49.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:33:26,864 INFO L158 Benchmark]: RCFGBuilder took 1287.79ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 49.6MB in the beginning and 55.9MB in the end (delta: -6.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2022-11-20 09:33:26,864 INFO L158 Benchmark]: TraceAbstraction took 47837.24ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 55.9MB in the beginning and 300.9MB in the end (delta: -245.0MB). Peak memory consumption was 198.6MB. Max. memory is 16.1GB. [2022-11-20 09:33:26,864 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 390.1MB. Free memory is still 300.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:33:26,866 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.30ms. Allocated memory is still 121.6MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.88ms. Allocated memory is still 121.6MB. Free memory was 76.9MB in the beginning and 54.2MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.81ms. Allocated memory is still 121.6MB. Free memory was 54.2MB in the beginning and 51.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.73ms. Allocated memory is still 121.6MB. Free memory was 51.7MB in the beginning and 49.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1287.79ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 49.6MB in the beginning and 55.9MB in the end (delta: -6.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * TraceAbstraction took 47837.24ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 55.9MB in the beginning and 300.9MB in the end (delta: -245.0MB). Peak memory consumption was 198.6MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 390.1MB. Free memory is still 300.9MB. 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: 28.1s, 174 PlacesBefore, 69 PlacesAfterwards, 166 TransitionsBefore, 60 TransitionsAfterwards, 4704 CoEnabledTransitionPairs, 9 FixpointIterations, 70 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 158 TotalNumberOfCompositions, 18051 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8041, independent: 7630, independent conditional: 0, independent unconditional: 7630, dependent: 336, dependent conditional: 0, dependent unconditional: 336, unknown: 75, unknown conditional: 0, unknown unconditional: 75] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3295, independent: 3208, independent conditional: 0, independent unconditional: 3208, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3295, independent: 2999, independent conditional: 0, independent unconditional: 2999, dependent: 296, dependent conditional: 0, dependent unconditional: 296, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 296, independent: 209, independent conditional: 0, independent unconditional: 209, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10112, independent: 922, independent conditional: 0, independent unconditional: 922, dependent: 820, dependent conditional: 0, dependent unconditional: 820, unknown: 8370, unknown conditional: 0, unknown unconditional: 8370] ], Cache Queries: [ total: 8041, independent: 4422, independent conditional: 0, independent unconditional: 4422, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 3360, unknown conditional: 0, unknown unconditional: 3360] , Statistics on independence cache: Total cache size (in pairs): 546, Positive cache size: 513, Positive conditional cache size: 0, Positive unconditional cache size: 513, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 4, Unknown conditional cache size: 0, Unknown unconditional cache size: 4 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t2061; [L837] FCALL, FORK 0 pthread_create(&t2061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2061, ((void *)0), P0, ((void *)0))=-2, t2061={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 \read(z) [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t2062; [L839] FCALL, FORK 0 pthread_create(&t2062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2062, ((void *)0), P1, ((void *)0))=-1, t2061={7:0}, t2062={8:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t2063; [L781] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L841] FCALL, FORK 0 pthread_create(&t2063, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2063, ((void *)0), P2, ((void *)0))=0, t2061={7:0}, t2062={8:0}, t2063={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L808] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, t2061={7:0}, t2062={8:0}, t2063={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: -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: -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: -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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: 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 7 procedures, 208 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 47.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 28.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 961 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 961 mSDsluCounter, 289 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1713 IncrementalHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 116 mSDtfsCounter, 1713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10940occurred in iteration=0, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 1656 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 2195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:33:26,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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_33251d58-18bd-4a0a-8837-a6e4da0194bc/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 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e --- 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:33:29,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:33:29,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:33:29,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:33:29,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:33:29,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:33:29,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:33:29,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:33:29,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:33:29,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:33:29,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:33:29,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:33:29,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:33:29,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:33:29,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:33:29,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:33:29,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:33:29,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:33:29,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:33:29,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:33:29,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:33:29,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:33:29,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:33:29,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:33:29,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:33:29,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:33:29,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:33:29,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:33:29,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:33:29,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:33:29,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:33:29,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:33:29,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:33:29,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:33:29,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:33:29,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:33:29,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:33:29,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:33:29,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:33:29,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:33:29,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:33:29,820 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 09:33:29,847 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:33:29,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:33:29,850 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:33:29,851 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:33:29,852 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:33:29,852 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:33:29,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:33:29,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:33:29,854 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:33:29,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:33:29,855 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:33:29,855 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:33:29,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:33:29,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:33:29,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:33:29,857 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:33:29,857 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:33:29,857 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:33:29,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:33:29,858 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:33:29,858 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 09:33:29,858 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 09:33:29,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:33:29,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:33:29,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:33:29,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:33:29,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:33:29,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:33:29,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:33:29,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:33:29,861 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 09:33:29,861 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 09:33:29,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 09:33:29,862 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_33251d58-18bd-4a0a-8837-a6e4da0194bc/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_33251d58-18bd-4a0a-8837-a6e4da0194bc/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 -> 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e [2022-11-20 09:33:30,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:33:30,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:33:30,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:33:30,372 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:33:30,373 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:33:30,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2022-11-20 09:33:33,867 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:33:34,223 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:33:34,224 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2022-11-20 09:33:34,254 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/data/6196b17cf/a4d21eee34d5403fa6dc4f619914506a/FLAGe6a93cfd0 [2022-11-20 09:33:34,272 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/data/6196b17cf/a4d21eee34d5403fa6dc4f619914506a [2022-11-20 09:33:34,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:33:34,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:33:34,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:33:34,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:33:34,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:33:34,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:33:34" (1/1) ... [2022-11-20 09:33:34,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b44f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:34, skipping insertion in model container [2022-11-20 09:33:34,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:33:34" (1/1) ... [2022-11-20 09:33:34,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:33:34,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:33:34,621 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_33251d58-18bd-4a0a-8837-a6e4da0194bc/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i[993,1006] [2022-11-20 09:33:35,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:33:35,071 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:33:35,091 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_33251d58-18bd-4a0a-8837-a6e4da0194bc/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i[993,1006] [2022-11-20 09:33:35,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:33:35,279 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:33:35,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:35 WrapperNode [2022-11-20 09:33:35,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:33:35,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:33:35,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:33:35,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:33:35,292 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:33:35" (1/1) ... [2022-11-20 09:33:35,330 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:33:35" (1/1) ... [2022-11-20 09:33:35,375 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2022-11-20 09:33:35,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:33:35,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:33:35,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:33:35,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:33:35,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:35" (1/1) ... [2022-11-20 09:33:35,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:35" (1/1) ... [2022-11-20 09:33:35,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:35" (1/1) ... [2022-11-20 09:33:35,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:35" (1/1) ... [2022-11-20 09:33:35,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:35" (1/1) ... [2022-11-20 09:33:35,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:35" (1/1) ... [2022-11-20 09:33:35,452 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:35" (1/1) ... [2022-11-20 09:33:35,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:35" (1/1) ... [2022-11-20 09:33:35,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:33:35,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:33:35,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:33:35,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:33:35,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:35" (1/1) ... [2022-11-20 09:33:35,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:33:35,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:35,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:33:35,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:33:35,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 09:33:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:33:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:33:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:33:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:33:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 09:33:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 09:33:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-20 09:33:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:33:35,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:33:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:33:35,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:33:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:33:35,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:33:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:33:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:33:35,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:33:35,611 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:33:35,898 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:33:35,901 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:33:36,600 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:33:37,052 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:33:37,052 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:33:37,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:33:37 BoogieIcfgContainer [2022-11-20 09:33:37,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:33:37,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:33:37,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:33:37,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:33:37,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:33:34" (1/3) ... [2022-11-20 09:33:37,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3987e0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:33:37, skipping insertion in model container [2022-11-20 09:33:37,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:33:35" (2/3) ... [2022-11-20 09:33:37,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3987e0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:33:37, skipping insertion in model container [2022-11-20 09:33:37,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:33:37" (3/3) ... [2022-11-20 09:33:37,067 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_rmo.oepc.i [2022-11-20 09:33:37,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:33:37,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-20 09:33:37,092 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:33:37,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:33:37,331 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 09:33:37,365 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 167 transitions, 349 flow [2022-11-20 09:33:37,371 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 167 transitions, 349 flow [2022-11-20 09:33:37,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 167 transitions, 349 flow [2022-11-20 09:33:37,488 INFO L130 PetriNetUnfolder]: 2/164 cut-off events. [2022-11-20 09:33:37,489 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:33:37,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 2/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 179 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-20 09:33:37,505 INFO L119 LiptonReduction]: Number of co-enabled transitions 4704 [2022-11-20 09:34:44,895 INFO L134 LiptonReduction]: Checked pairs total: 16756 [2022-11-20 09:34:44,895 INFO L136 LiptonReduction]: Total number of compositions: 157 [2022-11-20 09:34:44,907 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 60 transitions, 135 flow [2022-11-20 09:34:45,421 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10940 states, 10068 states have (on average 3.8646205800556217) internal successors, (38909), 10939 states have internal predecessors, (38909), 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:34:45,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:34:45,450 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;@8d013b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:34:45,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-11-20 09:34:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 10940 states, 10068 states have (on average 3.8646205800556217) internal successors, (38909), 10939 states have internal predecessors, (38909), 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:34:45,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 09:34:45,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:45,499 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 09:34:45,501 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:34:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash 834, now seen corresponding path program 1 times [2022-11-20 09:34:45,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:45,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937821046] [2022-11-20 09:34:45,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:45,527 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:34:45,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:45,530 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:45,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:45,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 09:34:45,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:45,697 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:34:45,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:34:45,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:34:45,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937821046] [2022-11-20 09:34:45,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937821046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:45,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:45,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 09:34:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965731476] [2022-11-20 09:34:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:45,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:34:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:34:45,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:34:45,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:34:45,759 INFO L87 Difference]: Start difference. First operand has 10940 states, 10068 states have (on average 3.8646205800556217) internal successors, (38909), 10939 states have internal predecessors, (38909), 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:34:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:46,125 INFO L93 Difference]: Finished difference Result 3308 states and 11165 transitions. [2022-11-20 09:34:46,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:34:46,136 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:34:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:46,178 INFO L225 Difference]: With dead ends: 3308 [2022-11-20 09:34:46,179 INFO L226 Difference]: Without dead ends: 3308 [2022-11-20 09:34:46,179 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:34:46,183 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:46,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:34:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2022-11-20 09:34:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3308. [2022-11-20 09:34:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3308 states, 3174 states have (on average 3.517643352236925) internal successors, (11165), 3307 states have internal predecessors, (11165), 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:34:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 11165 transitions. [2022-11-20 09:34:46,482 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 11165 transitions. Word has length 1 [2022-11-20 09:34:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:46,482 INFO L495 AbstractCegarLoop]: Abstraction has 3308 states and 11165 transitions. [2022-11-20 09:34:46,500 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:34:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 11165 transitions. [2022-11-20 09:34:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:34:46,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:46,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:34:46,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:46,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:46,704 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:34:46,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash 821204, now seen corresponding path program 1 times [2022-11-20 09:34:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:46,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615292461] [2022-11-20 09:34:46,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:46,706 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:34:46,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:46,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:46,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:46,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:34:46,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:47,035 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 09:34:47,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 09:34:47,119 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:34:47,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:34:47,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:34:47,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615292461] [2022-11-20 09:34:47,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615292461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:47,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:47,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:34:47,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121967194] [2022-11-20 09:34:47,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:47,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:34:47,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:34:47,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:34:47,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:34:47,126 INFO L87 Difference]: Start difference. First operand 3308 states and 11165 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:34:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:47,698 INFO L93 Difference]: Finished difference Result 1997 states and 6530 transitions. [2022-11-20 09:34:47,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:34:47,699 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:34:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:47,722 INFO L225 Difference]: With dead ends: 1997 [2022-11-20 09:34:47,722 INFO L226 Difference]: Without dead ends: 1997 [2022-11-20 09:34:47,729 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:34:47,730 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:47,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 5 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:34:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2022-11-20 09:34:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1997. [2022-11-20 09:34:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1948 states have (on average 3.3521560574948666) internal successors, (6530), 1996 states have internal predecessors, (6530), 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:34:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 6530 transitions. [2022-11-20 09:34:47,856 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 6530 transitions. Word has length 3 [2022-11-20 09:34:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:47,856 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 6530 transitions. [2022-11-20 09:34:47,857 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:34:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 6530 transitions. [2022-11-20 09:34:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:34:47,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:47,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:34:47,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:48,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:48,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:34:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:48,081 INFO L85 PathProgramCache]: Analyzing trace with hash 821205, now seen corresponding path program 1 times [2022-11-20 09:34:48,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:48,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009237730] [2022-11-20 09:34:48,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:48,084 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:34:48,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:48,086 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:48,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:48,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:34:48,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:48,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:48,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:34:48,345 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:34:48,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:34:48,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:34:48,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009237730] [2022-11-20 09:34:48,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009237730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:48,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:48,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:34:48,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69181790] [2022-11-20 09:34:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:48,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:34:48,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:34:48,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:34:48,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:34:48,348 INFO L87 Difference]: Start difference. First operand 1997 states and 6530 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:34:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:48,595 INFO L93 Difference]: Finished difference Result 1238 states and 3933 transitions. [2022-11-20 09:34:48,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:34:48,596 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:34:48,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:48,607 INFO L225 Difference]: With dead ends: 1238 [2022-11-20 09:34:48,607 INFO L226 Difference]: Without dead ends: 1238 [2022-11-20 09:34:48,607 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:34:48,609 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:48,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:34:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-11-20 09:34:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2022-11-20 09:34:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1220 states have (on average 3.2237704918032786) internal successors, (3933), 1237 states have internal predecessors, (3933), 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:34:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 3933 transitions. [2022-11-20 09:34:48,663 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 3933 transitions. Word has length 3 [2022-11-20 09:34:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:48,664 INFO L495 AbstractCegarLoop]: Abstraction has 1238 states and 3933 transitions. [2022-11-20 09:34:48,664 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:34:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 3933 transitions. [2022-11-20 09:34:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 09:34:48,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:48,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:34:48,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:48,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:48,880 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:34:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:48,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1468643277, now seen corresponding path program 1 times [2022-11-20 09:34:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:48,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494765124] [2022-11-20 09:34:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:48,882 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:34:48,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:48,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:48,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:49,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:34:49,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:49,172 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:34:49,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:34:49,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:34:49,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494765124] [2022-11-20 09:34:49,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494765124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:49,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:49,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:34:49,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114776527] [2022-11-20 09:34:49,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:49,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:34:49,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:34:49,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:34:49,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:34:49,177 INFO L87 Difference]: Start difference. First operand 1238 states and 3933 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:34:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:49,510 INFO L93 Difference]: Finished difference Result 1198 states and 3791 transitions. [2022-11-20 09:34:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:34:49,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-11-20 09:34:49,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:49,523 INFO L225 Difference]: With dead ends: 1198 [2022-11-20 09:34:49,523 INFO L226 Difference]: Without dead ends: 1198 [2022-11-20 09:34:49,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:34:49,525 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:49,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:34:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2022-11-20 09:34:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2022-11-20 09:34:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1180 states have (on average 3.2127118644067796) internal successors, (3791), 1197 states have internal predecessors, (3791), 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:34:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 3791 transitions. [2022-11-20 09:34:49,587 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 3791 transitions. Word has length 10 [2022-11-20 09:34:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:49,589 INFO L495 AbstractCegarLoop]: Abstraction has 1198 states and 3791 transitions. [2022-11-20 09:34:49,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:34:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 3791 transitions. [2022-11-20 09:34:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:34:49,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:49,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:34:49,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:49,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:49,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:34:49,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:49,808 INFO L85 PathProgramCache]: Analyzing trace with hash -358900663, now seen corresponding path program 1 times [2022-11-20 09:34:49,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:49,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351044847] [2022-11-20 09:34:49,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:49,808 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:34:49,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:49,809 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:49,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:50,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:34:50,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:50,141 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:34:50,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:34:50,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:34:50,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351044847] [2022-11-20 09:34:50,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351044847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:50,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:50,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:34:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357097070] [2022-11-20 09:34:50,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:50,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:34:50,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:34:50,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:34:50,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:34:50,144 INFO L87 Difference]: Start difference. First operand 1198 states and 3791 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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:34:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:50,665 INFO L93 Difference]: Finished difference Result 756 states and 1980 transitions. [2022-11-20 09:34:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:34:50,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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:34:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:50,670 INFO L225 Difference]: With dead ends: 756 [2022-11-20 09:34:50,671 INFO L226 Difference]: Without dead ends: 676 [2022-11-20 09:34:50,671 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:34:50,672 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:50,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 24 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:34:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-20 09:34:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2022-11-20 09:34:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 658 states have (on average 2.674772036474164) internal successors, (1760), 675 states have internal predecessors, (1760), 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:34:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1760 transitions. [2022-11-20 09:34:50,699 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1760 transitions. Word has length 11 [2022-11-20 09:34:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:50,699 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 1760 transitions. [2022-11-20 09:34:50,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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:34:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1760 transitions. [2022-11-20 09:34:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:34:50,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:50,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:34:50,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:50,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:50,915 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:34:50,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:50,916 INFO L85 PathProgramCache]: Analyzing trace with hash 382279735, now seen corresponding path program 1 times [2022-11-20 09:34:50,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:50,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798269973] [2022-11-20 09:34:50,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:50,917 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:34:50,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:50,918 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:50,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:51,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:34:51,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:51,257 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:34:51,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:34:51,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:34:51,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798269973] [2022-11-20 09:34:51,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798269973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:51,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:51,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:34:51,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63020550] [2022-11-20 09:34:51,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:51,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:34:51,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:34:51,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:34:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:34:51,261 INFO L87 Difference]: Start difference. First operand 676 states and 1760 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:34:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:51,978 INFO L93 Difference]: Finished difference Result 303 states and 655 transitions. [2022-11-20 09:34:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:34:51,979 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:34:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:51,981 INFO L225 Difference]: With dead ends: 303 [2022-11-20 09:34:51,981 INFO L226 Difference]: Without dead ends: 259 [2022-11-20 09:34:51,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:34:51,982 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:51,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 43 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 09:34:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-20 09:34:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-11-20 09:34:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 247 states have (on average 2.210526315789474) internal successors, (546), 258 states have internal predecessors, (546), 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:34:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 546 transitions. [2022-11-20 09:34:51,993 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 546 transitions. Word has length 13 [2022-11-20 09:34:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:51,994 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 546 transitions. [2022-11-20 09:34:51,994 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:34:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 546 transitions. [2022-11-20 09:34:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:34:51,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:51,996 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:34:52,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:52,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:52,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:34:52,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash -691095028, now seen corresponding path program 1 times [2022-11-20 09:34:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:52,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536084924] [2022-11-20 09:34:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:52,212 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:34:52,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:52,213 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:52,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:52,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:34:52,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:52,581 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:34:52,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:34:52,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:34:52,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536084924] [2022-11-20 09:34:52,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536084924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:52,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:52,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:34:52,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818888932] [2022-11-20 09:34:52,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:52,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:34:52,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:34:52,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:34:52,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:34:52,584 INFO L87 Difference]: Start difference. First operand 259 states and 546 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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:34:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:53,419 INFO L93 Difference]: Finished difference Result 162 states and 356 transitions. [2022-11-20 09:34:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:34:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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:34:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:53,421 INFO L225 Difference]: With dead ends: 162 [2022-11-20 09:34:53,421 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 09:34:53,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:34:53,422 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:53,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 65 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 09:34:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 09:34:53,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-20 09:34:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 2.2857142857142856) internal successors, (336), 150 states have internal predecessors, (336), 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:34:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 336 transitions. [2022-11-20 09:34:53,446 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 336 transitions. Word has length 16 [2022-11-20 09:34:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:53,446 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 336 transitions. [2022-11-20 09:34:53,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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:34:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 336 transitions. [2022-11-20 09:34:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 09:34:53,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:53,462 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] [2022-11-20 09:34:53,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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)] Ended with exit code 0 [2022-11-20 09:34:53,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:53,683 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:34:53,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:53,684 INFO L85 PathProgramCache]: Analyzing trace with hash -498968824, now seen corresponding path program 1 times [2022-11-20 09:34:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:53,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761711062] [2022-11-20 09:34:53,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:53,685 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:34:53,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:53,687 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:53,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:53,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 09:34:53,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:54,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 09:34:54,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 09:34:54,629 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:34:54,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:34:54,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:34:54,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761711062] [2022-11-20 09:34:54,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761711062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:54,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:54,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:34:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761838715] [2022-11-20 09:34:54,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:54,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:34:54,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:34:54,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:34:54,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:34:54,632 INFO L87 Difference]: Start difference. First operand 151 states and 336 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:34:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:54,999 INFO L93 Difference]: Finished difference Result 150 states and 335 transitions. [2022-11-20 09:34:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:34:55,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-11-20 09:34:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:55,001 INFO L225 Difference]: With dead ends: 150 [2022-11-20 09:34:55,001 INFO L226 Difference]: Without dead ends: 150 [2022-11-20 09:34:55,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:34:55,003 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:55,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 10 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:34:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-20 09:34:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-20 09:34:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 2.2789115646258504) internal successors, (335), 149 states have internal predecessors, (335), 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:34:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 335 transitions. [2022-11-20 09:34:55,009 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 335 transitions. Word has length 20 [2022-11-20 09:34:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:55,009 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 335 transitions. [2022-11-20 09:34:55,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:34:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 335 transitions. [2022-11-20 09:34:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 09:34:55,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:55,011 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] [2022-11-20 09:34:55,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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)] Forceful destruction successful, exit code 0 [2022-11-20 09:34:55,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:55,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:34:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:55,227 INFO L85 PathProgramCache]: Analyzing trace with hash -498968823, now seen corresponding path program 1 times [2022-11-20 09:34:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:55,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996552845] [2022-11-20 09:34:55,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:55,228 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:34:55,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:55,232 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:55,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:55,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:34:55,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:55,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 09:34:55,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 09:34:56,374 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:34:56,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:34:56,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:34:56,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996552845] [2022-11-20 09:34:56,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996552845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:56,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:56,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:34:56,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882009388] [2022-11-20 09:34:56,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:56,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:34:56,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:34:56,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:34:56,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:34:56,377 INFO L87 Difference]: Start difference. First operand 150 states and 335 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:34:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:56,809 INFO L93 Difference]: Finished difference Result 149 states and 334 transitions. [2022-11-20 09:34:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:34:56,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-11-20 09:34:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:56,812 INFO L225 Difference]: With dead ends: 149 [2022-11-20 09:34:56,812 INFO L226 Difference]: Without dead ends: 149 [2022-11-20 09:34:56,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:34:56,813 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:56,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 9 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:34:56,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-20 09:34:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-20 09:34:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 2.272108843537415) internal successors, (334), 148 states have internal predecessors, (334), 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:34:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 334 transitions. [2022-11-20 09:34:56,818 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 334 transitions. Word has length 20 [2022-11-20 09:34:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:56,819 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 334 transitions. [2022-11-20 09:34:56,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:34:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 334 transitions. [2022-11-20 09:34:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:34:56,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:56,820 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] [2022-11-20 09:34:56,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:57,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:57,031 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:34:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:57,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1711836396, now seen corresponding path program 1 times [2022-11-20 09:34:57,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:57,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99371466] [2022-11-20 09:34:57,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:57,032 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:34:57,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:57,034 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:57,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:57,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:34:57,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:57,380 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:34:57,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:34:57,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:34:57,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99371466] [2022-11-20 09:34:57,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99371466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:57,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:57,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:34:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523054883] [2022-11-20 09:34:57,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:57,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:34:57,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:34:57,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:34:57,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:34:57,383 INFO L87 Difference]: Start difference. First operand 149 states and 334 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:34:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:57,745 INFO L93 Difference]: Finished difference Result 203 states and 438 transitions. [2022-11-20 09:34:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:34:57,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2022-11-20 09:34:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:57,747 INFO L225 Difference]: With dead ends: 203 [2022-11-20 09:34:57,747 INFO L226 Difference]: Without dead ends: 203 [2022-11-20 09:34:57,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:34:57,749 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:57,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 19 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:34:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-20 09:34:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2022-11-20 09:34:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.2081218274111674) internal successors, (435), 198 states have internal predecessors, (435), 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:34:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 435 transitions. [2022-11-20 09:34:57,757 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 435 transitions. Word has length 21 [2022-11-20 09:34:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:57,757 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 435 transitions. [2022-11-20 09:34:57,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:34:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 435 transitions. [2022-11-20 09:34:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:34:57,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:57,759 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] [2022-11-20 09:34:57,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:57,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:57,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:34:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1972304084, now seen corresponding path program 2 times [2022-11-20 09:34:57,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:57,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331920097] [2022-11-20 09:34:57,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:34:57,976 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:34:57,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:57,977 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:57,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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 (12)] Waiting until timeout for monitored process [2022-11-20 09:34:58,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 09:34:58,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:34:58,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:34:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:34:58,498 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 09:34:58,498 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:34:58,499 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2022-11-20 09:34:58,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2022-11-20 09:34:58,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2022-11-20 09:34:58,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2022-11-20 09:34:58,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2022-11-20 09:34:58,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2022-11-20 09:34:58,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2022-11-20 09:34:58,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2022-11-20 09:34:58,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2022-11-20 09:34:58,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2022-11-20 09:34:58,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2022-11-20 09:34:58,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2022-11-20 09:34:58,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2022-11-20 09:34:58,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2022-11-20 09:34:58,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2022-11-20 09:34:58,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2022-11-20 09:34:58,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2022-11-20 09:34:58,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2022-11-20 09:34:58,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2022-11-20 09:34:58,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2022-11-20 09:34:58,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2022-11-20 09:34:58,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2022-11-20 09:34:58,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2022-11-20 09:34:58,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2022-11-20 09:34:58,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2022-11-20 09:34:58,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2022-11-20 09:34:58,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2022-11-20 09:34:58,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2022-11-20 09:34:58,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2022-11-20 09:34:58,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2022-11-20 09:34:58,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2022-11-20 09:34:58,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2022-11-20 09:34:58,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2022-11-20 09:34:58,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2022-11-20 09:34:58,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2022-11-20 09:34:58,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2022-11-20 09:34:58,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2022-11-20 09:34:58,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2022-11-20 09:34:58,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2022-11-20 09:34:58,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2022-11-20 09:34:58,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2022-11-20 09:34:58,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2022-11-20 09:34:58,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2022-11-20 09:34:58,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2022-11-20 09:34:58,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2022-11-20 09:34:58,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2022-11-20 09:34:58,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2022-11-20 09:34:58,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2022-11-20 09:34:58,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2022-11-20 09:34:58,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2022-11-20 09:34:58,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2022-11-20 09:34:58,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2022-11-20 09:34:58,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2022-11-20 09:34:58,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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 (12)] Forceful destruction successful, exit code 0 [2022-11-20 09:34:58,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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:34:58,732 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:34:58,738 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:34:58,738 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:34:58,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:34:58 BasicIcfg [2022-11-20 09:34:58,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:34:58,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:34:58,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:34:58,845 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:34:58,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:33:37" (3/4) ... [2022-11-20 09:34:58,849 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:34:58,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:34:58,850 INFO L158 Benchmark]: Toolchain (without parser) took 84573.51ms. Allocated memory was 69.2MB in the beginning and 253.8MB in the end (delta: 184.5MB). Free memory was 46.3MB in the beginning and 117.8MB in the end (delta: -71.5MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. [2022-11-20 09:34:58,851 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 69.2MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:34:58,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1001.81ms. Allocated memory was 69.2MB in the beginning and 107.0MB in the end (delta: 37.7MB). Free memory was 46.0MB in the beginning and 81.7MB in the end (delta: -35.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2022-11-20 09:34:58,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.31ms. Allocated memory is still 107.0MB. Free memory was 81.7MB in the beginning and 79.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 09:34:58,852 INFO L158 Benchmark]: Boogie Preprocessor took 91.58ms. Allocated memory is still 107.0MB. Free memory was 79.1MB in the beginning and 76.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:34:58,852 INFO L158 Benchmark]: RCFGBuilder took 1582.11ms. Allocated memory is still 107.0MB. Free memory was 76.5MB in the beginning and 53.5MB in the end (delta: 23.0MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-11-20 09:34:58,853 INFO L158 Benchmark]: TraceAbstraction took 81786.18ms. Allocated memory was 107.0MB in the beginning and 253.8MB in the end (delta: 146.8MB). Free memory was 52.8MB in the beginning and 117.8MB in the end (delta: -65.0MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2022-11-20 09:34:58,853 INFO L158 Benchmark]: Witness Printer took 4.92ms. Allocated memory is still 253.8MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:34:58,855 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.38ms. Allocated memory is still 69.2MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1001.81ms. Allocated memory was 69.2MB in the beginning and 107.0MB in the end (delta: 37.7MB). Free memory was 46.0MB in the beginning and 81.7MB in the end (delta: -35.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.31ms. Allocated memory is still 107.0MB. Free memory was 81.7MB in the beginning and 79.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.58ms. Allocated memory is still 107.0MB. Free memory was 79.1MB in the beginning and 76.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1582.11ms. Allocated memory is still 107.0MB. Free memory was 76.5MB in the beginning and 53.5MB in the end (delta: 23.0MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * TraceAbstraction took 81786.18ms. Allocated memory was 107.0MB in the beginning and 253.8MB in the end (delta: 146.8MB). Free memory was 52.8MB in the beginning and 117.8MB in the end (delta: -65.0MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. * Witness Printer took 4.92ms. Allocated memory is still 253.8MB. Free memory is still 117.8MB. 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: 67.5s, 175 PlacesBefore, 69 PlacesAfterwards, 167 TransitionsBefore, 60 TransitionsAfterwards, 4704 CoEnabledTransitionPairs, 8 FixpointIterations, 65 TrivialSequentialCompositions, 85 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 157 TotalNumberOfCompositions, 16756 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8320, independent: 7950, independent conditional: 0, independent unconditional: 7950, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 110, unknown conditional: 0, unknown unconditional: 110] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3408, independent: 3316, independent conditional: 0, independent unconditional: 3316, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3408, independent: 3078, independent conditional: 0, independent unconditional: 3078, dependent: 330, dependent conditional: 0, dependent unconditional: 330, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 330, independent: 238, independent conditional: 0, independent unconditional: 238, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12813, independent: 1221, independent conditional: 0, independent unconditional: 1221, dependent: 1705, dependent conditional: 0, dependent unconditional: 1705, unknown: 9887, unknown conditional: 0, unknown unconditional: 9887] ], Cache Queries: [ total: 8320, independent: 4634, independent conditional: 0, independent unconditional: 4634, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 3504, unknown conditional: 0, unknown unconditional: 3504] , Statistics on independence cache: Total cache size (in pairs): 567, Positive cache size: 537, Positive conditional cache size: 0, Positive unconditional cache size: 537, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 9, Unknown conditional cache size: 0, Unknown unconditional cache size: 9 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t2061; [L837] FCALL, FORK 0 pthread_create(&t2061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2061, ((void *)0), P0, ((void *)0))=-1, t2061={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 \read(z) [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t2062; [L839] FCALL, FORK 0 pthread_create(&t2062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2062, ((void *)0), P1, ((void *)0))=0, t2061={7:0}, t2062={14:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t2063; [L781] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L841] FCALL, FORK 0 pthread_create(&t2063, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2063, ((void *)0), P2, ((void *)0))=1, t2061={7:0}, t2062={14:0}, t2063={15:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L808] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, t2061={7:0}, t2062={14:0}, t2063={15:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=2, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: -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: -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: -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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: 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 7 procedures, 209 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 81.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 68.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 294 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 294 mSDsluCounter, 195 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 799 IncrementalHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 78 mSDtfsCounter, 799 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10940occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 489 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1351 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:34:58,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33251d58-18bd-4a0a-8837-a6e4da0194bc/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