./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro --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 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e --- 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-8393723 [2022-11-18 19:49:35,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:49:35,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:49:35,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:49:35,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:49:35,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:49:35,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:49:35,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:49:35,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:49:35,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:49:35,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:49:35,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:49:35,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:49:35,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:49:35,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:49:35,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:49:35,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:49:35,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:49:35,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:49:35,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:49:35,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:49:35,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:49:35,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:49:35,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:49:35,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:49:35,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:49:35,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:49:35,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:49:35,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:49:35,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:49:35,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:49:36,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:49:36,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:49:36,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:49:36,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:49:36,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:49:36,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:49:36,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:49:36,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:49:36,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:49:36,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:49:36,014 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 19:49:36,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:49:36,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:49:36,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:49:36,067 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:49:36,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:49:36,068 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:49:36,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:49:36,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:49:36,070 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:49:36,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:49:36,071 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:49:36,072 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:49:36,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:49:36,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:49:36,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:49:36,073 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 19:49:36,073 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 19:49:36,073 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 19:49:36,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:49:36,074 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:49:36,074 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:49:36,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:49:36,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:49:36,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:49:36,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:49:36,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:49:36,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:49:36,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:49:36,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:49:36,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:49:36,079 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_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro 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 -> 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e [2022-11-18 19:49:36,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:49:36,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:49:36,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:49:36,476 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:49:36,477 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:49:36,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-18 19:49:36,571 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/data/5f8cc7c6d/b50814e5fc5a4434afbfaf2ce38e51d2/FLAG1a651a150 [2022-11-18 19:49:37,375 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:49:37,376 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-18 19:49:37,399 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/data/5f8cc7c6d/b50814e5fc5a4434afbfaf2ce38e51d2/FLAG1a651a150 [2022-11-18 19:49:37,583 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/data/5f8cc7c6d/b50814e5fc5a4434afbfaf2ce38e51d2 [2022-11-18 19:49:37,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:49:37,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:49:37,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:49:37,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:49:37,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:49:37,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:49:37" (1/1) ... [2022-11-18 19:49:37,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aabf4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:37, skipping insertion in model container [2022-11-18 19:49:37,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:49:37" (1/1) ... [2022-11-18 19:49:37,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:49:37,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:49:38,006 WARN L234 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_59953d96-ebb1-4d7c-b854-f096d42f0295/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-18 19:49:38,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:49:38,450 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:49:38,466 WARN L234 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_59953d96-ebb1-4d7c-b854-f096d42f0295/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-18 19:49:38,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:49:38,578 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:49:38,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38 WrapperNode [2022-11-18 19:49:38,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:49:38,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:49:38,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:49:38,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:49:38,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (1/1) ... [2022-11-18 19:49:38,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (1/1) ... [2022-11-18 19:49:38,698 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-11-18 19:49:38,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:49:38,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:49:38,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:49:38,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:49:38,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (1/1) ... [2022-11-18 19:49:38,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (1/1) ... [2022-11-18 19:49:38,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (1/1) ... [2022-11-18 19:49:38,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (1/1) ... [2022-11-18 19:49:38,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (1/1) ... [2022-11-18 19:49:38,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (1/1) ... [2022-11-18 19:49:38,771 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (1/1) ... [2022-11-18 19:49:38,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (1/1) ... [2022-11-18 19:49:38,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:49:38,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:49:38,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:49:38,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:49:38,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (1/1) ... [2022-11-18 19:49:38,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:49:38,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:49:38,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:49:38,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:49:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:49:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:49:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:49:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:49:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:49:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:49:38,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:49:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:49:38,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:49:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:49:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:49:38,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:49:38,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:49:38,916 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:49:39,166 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:49:39,169 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:49:39,668 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:49:40,077 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:49:40,077 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:49:40,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:49:40 BoogieIcfgContainer [2022-11-18 19:49:40,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:49:40,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:49:40,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:49:40,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:49:40,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:49:37" (1/3) ... [2022-11-18 19:49:40,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2007c982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:49:40, skipping insertion in model container [2022-11-18 19:49:40,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:38" (2/3) ... [2022-11-18 19:49:40,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2007c982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:49:40, skipping insertion in model container [2022-11-18 19:49:40,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:49:40" (3/3) ... [2022-11-18 19:49:40,104 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2022-11-18 19:49:40,131 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:49:40,132 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-18 19:49:40,132 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:49:40,250 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:49:40,298 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 19:49:40,317 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 106 transitions, 222 flow [2022-11-18 19:49:40,321 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 106 transitions, 222 flow [2022-11-18 19:49:40,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 106 transitions, 222 flow [2022-11-18 19:49:40,421 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-11-18 19:49:40,421 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:49:40,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2022-11-18 19:49:40,432 INFO L119 LiptonReduction]: Number of co-enabled transitions 1340 [2022-11-18 19:49:47,445 INFO L134 LiptonReduction]: Checked pairs total: 3661 [2022-11-18 19:49:47,445 INFO L136 LiptonReduction]: Total number of compositions: 111 [2022-11-18 19:49:47,456 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 27 transitions, 64 flow [2022-11-18 19:49:47,503 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 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-18 19:49:47,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:49:47,536 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;@115a0214, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:49:47,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-18 19:49:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 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-18 19:49:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 19:49:47,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:47,547 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 19:49:47,548 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:47,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash 495, now seen corresponding path program 1 times [2022-11-18 19:49:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:47,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644582389] [2022-11-18 19:49:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:47,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:47,709 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-18 19:49:47,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:47,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644582389] [2022-11-18 19:49:47,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644582389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:47,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:47,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 19:49:47,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763198756] [2022-11-18 19:49:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:47,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:49:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:47,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:49:47,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:49:47,766 INFO L87 Difference]: Start difference. First operand has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 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-18 19:49:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:47,865 INFO L93 Difference]: Finished difference Result 232 states and 566 transitions. [2022-11-18 19:49:47,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:49:47,868 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-18 19:49:47,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:47,882 INFO L225 Difference]: With dead ends: 232 [2022-11-18 19:49:47,883 INFO L226 Difference]: Without dead ends: 232 [2022-11-18 19:49:47,884 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-18 19:49:47,888 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:47,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:49:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-18 19:49:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-11-18 19:49:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 2.4933920704845813) internal successors, (566), 231 states have internal predecessors, (566), 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-18 19:49:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 566 transitions. [2022-11-18 19:49:47,956 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 566 transitions. Word has length 1 [2022-11-18 19:49:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:47,957 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 566 transitions. [2022-11-18 19:49:47,958 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-18 19:49:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 566 transitions. [2022-11-18 19:49:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 19:49:47,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:47,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 19:49:47,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:49:47,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash 469014954, now seen corresponding path program 1 times [2022-11-18 19:49:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:47,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337227679] [2022-11-18 19:49:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:48,509 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-18 19:49:48,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:48,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337227679] [2022-11-18 19:49:48,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337227679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:48,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:48,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:49:48,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918613157] [2022-11-18 19:49:48,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:48,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:49:48,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:48,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:49:48,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:49:48,519 INFO L87 Difference]: Start difference. First operand 232 states and 566 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-18 19:49:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:48,650 INFO L93 Difference]: Finished difference Result 197 states and 473 transitions. [2022-11-18 19:49:48,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:49:48,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-18 19:49:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:48,655 INFO L225 Difference]: With dead ends: 197 [2022-11-18 19:49:48,658 INFO L226 Difference]: Without dead ends: 192 [2022-11-18 19:49:48,660 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-18 19:49:48,662 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:48,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:49:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-18 19:49:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-18 19:49:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.442105263157895) internal successors, (464), 191 states have internal predecessors, (464), 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-18 19:49:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 464 transitions. [2022-11-18 19:49:48,696 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 464 transitions. Word has length 5 [2022-11-18 19:49:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:48,697 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 464 transitions. [2022-11-18 19:49:48,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-18 19:49:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 464 transitions. [2022-11-18 19:49:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 19:49:48,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:48,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:48,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:49:48,700 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:48,703 INFO L85 PathProgramCache]: Analyzing trace with hash 897959059, now seen corresponding path program 1 times [2022-11-18 19:49:48,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:48,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372303579] [2022-11-18 19:49:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:48,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:49,127 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-18 19:49:49,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:49,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372303579] [2022-11-18 19:49:49,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372303579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:49,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:49,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:49:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653819328] [2022-11-18 19:49:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:49,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:49:49,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:49,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:49:49,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:49:49,134 INFO L87 Difference]: Start difference. First operand 192 states and 464 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-18 19:49:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:49,314 INFO L93 Difference]: Finished difference Result 240 states and 560 transitions. [2022-11-18 19:49:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:49:49,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-11-18 19:49:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:49,317 INFO L225 Difference]: With dead ends: 240 [2022-11-18 19:49:49,317 INFO L226 Difference]: Without dead ends: 240 [2022-11-18 19:49:49,318 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-18 19:49:49,319 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:49,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:49:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-18 19:49:49,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 214. [2022-11-18 19:49:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 2.44811320754717) internal successors, (519), 213 states have internal predecessors, (519), 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-18 19:49:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 519 transitions. [2022-11-18 19:49:49,337 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 519 transitions. Word has length 8 [2022-11-18 19:49:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:49,337 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 519 transitions. [2022-11-18 19:49:49,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-18 19:49:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 519 transitions. [2022-11-18 19:49:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 19:49:49,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:49,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:49,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:49:49,340 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash 897959084, now seen corresponding path program 1 times [2022-11-18 19:49:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:49,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817040045] [2022-11-18 19:49:49,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:49:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:49,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817040045] [2022-11-18 19:49:49,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817040045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:49,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:49,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:49:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386181326] [2022-11-18 19:49:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:49,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:49:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:49,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:49:49,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:49:49,624 INFO L87 Difference]: Start difference. First operand 214 states and 519 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-18 19:49:49,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:49,747 INFO L93 Difference]: Finished difference Result 295 states and 671 transitions. [2022-11-18 19:49:49,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:49:49,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-11-18 19:49:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:49,749 INFO L225 Difference]: With dead ends: 295 [2022-11-18 19:49:49,750 INFO L226 Difference]: Without dead ends: 265 [2022-11-18 19:49:49,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:49:49,751 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:49,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:49:49,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-18 19:49:49,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2022-11-18 19:49:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 245 states have (on average 2.4122448979591837) internal successors, (591), 246 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:49:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 591 transitions. [2022-11-18 19:49:49,767 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 591 transitions. Word has length 8 [2022-11-18 19:49:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:49,768 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 591 transitions. [2022-11-18 19:49:49,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-18 19:49:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 591 transitions. [2022-11-18 19:49:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 19:49:49,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:49,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:49,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:49:49,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:49,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1905444608, now seen corresponding path program 1 times [2022-11-18 19:49:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:49,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789960685] [2022-11-18 19:49:49,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:49,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:49,988 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-18 19:49:49,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:49,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789960685] [2022-11-18 19:49:49,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789960685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:49,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:49,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:49:49,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588207855] [2022-11-18 19:49:49,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:49,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:49:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:49,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:49:49,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:49:49,997 INFO L87 Difference]: Start difference. First operand 247 states and 591 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-18 19:49:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:50,140 INFO L93 Difference]: Finished difference Result 277 states and 632 transitions. [2022-11-18 19:49:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:49:50,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-18 19:49:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:50,148 INFO L225 Difference]: With dead ends: 277 [2022-11-18 19:49:50,155 INFO L226 Difference]: Without dead ends: 259 [2022-11-18 19:49:50,156 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-18 19:49:50,157 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:50,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:49:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-18 19:49:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 247. [2022-11-18 19:49:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 245 states have (on average 2.3755102040816327) internal successors, (582), 246 states have internal predecessors, (582), 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-18 19:49:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 582 transitions. [2022-11-18 19:49:50,176 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 582 transitions. Word has length 10 [2022-11-18 19:49:50,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:50,176 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 582 transitions. [2022-11-18 19:49:50,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-18 19:49:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 582 transitions. [2022-11-18 19:49:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 19:49:50,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:50,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:50,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:49:50,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:50,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:50,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1905444633, now seen corresponding path program 1 times [2022-11-18 19:49:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:50,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821617930] [2022-11-18 19:49:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:50,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:50,541 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-18 19:49:50,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:50,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821617930] [2022-11-18 19:49:50,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821617930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:50,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:50,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:49:50,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696104537] [2022-11-18 19:49:50,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:50,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:49:50,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:50,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:49:50,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:49:50,547 INFO L87 Difference]: Start difference. First operand 247 states and 582 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-18 19:49:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:50,640 INFO L93 Difference]: Finished difference Result 229 states and 525 transitions. [2022-11-18 19:49:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:49:50,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-18 19:49:50,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:50,643 INFO L225 Difference]: With dead ends: 229 [2022-11-18 19:49:50,643 INFO L226 Difference]: Without dead ends: 211 [2022-11-18 19:49:50,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:49:50,645 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:50,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:49:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-18 19:49:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 142. [2022-11-18 19:49:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.3333333333333335) internal successors, (329), 141 states have internal predecessors, (329), 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-18 19:49:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2022-11-18 19:49:50,653 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 10 [2022-11-18 19:49:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:50,654 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2022-11-18 19:49:50,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-18 19:49:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2022-11-18 19:49:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 19:49:50,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:50,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:50,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:49:50,658 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:50,658 INFO L85 PathProgramCache]: Analyzing trace with hash -372001920, now seen corresponding path program 1 times [2022-11-18 19:49:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:50,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303562596] [2022-11-18 19:49:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:50,964 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-18 19:49:50,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:50,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303562596] [2022-11-18 19:49:50,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303562596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:50,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:50,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:49:50,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292818807] [2022-11-18 19:49:50,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:50,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:49:50,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:50,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:49:50,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:49:50,970 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-18 19:49:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:51,112 INFO L93 Difference]: Finished difference Result 146 states and 324 transitions. [2022-11-18 19:49:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:49:51,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-18 19:49:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:51,114 INFO L225 Difference]: With dead ends: 146 [2022-11-18 19:49:51,114 INFO L226 Difference]: Without dead ends: 126 [2022-11-18 19:49:51,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:49:51,115 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:51,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 8 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:49:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-18 19:49:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-18 19:49:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.28) internal successors, (285), 125 states have internal predecessors, (285), 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-18 19:49:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 285 transitions. [2022-11-18 19:49:51,124 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 285 transitions. Word has length 10 [2022-11-18 19:49:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:51,124 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 285 transitions. [2022-11-18 19:49:51,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-18 19:49:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 285 transitions. [2022-11-18 19:49:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 19:49:51,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:51,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:51,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:49:51,128 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:51,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:51,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1453969069, now seen corresponding path program 1 times [2022-11-18 19:49:51,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:51,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213119523] [2022-11-18 19:49:51,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:51,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:51,375 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-18 19:49:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:51,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213119523] [2022-11-18 19:49:51,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213119523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:51,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:51,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:49:51,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837602566] [2022-11-18 19:49:51,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:51,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:49:51,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:51,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:49:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:49:51,378 INFO L87 Difference]: Start difference. First operand 126 states and 285 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-18 19:49:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:51,448 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2022-11-18 19:49:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:49:51,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-18 19:49:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:51,454 INFO L225 Difference]: With dead ends: 74 [2022-11-18 19:49:51,454 INFO L226 Difference]: Without dead ends: 74 [2022-11-18 19:49:51,454 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-18 19:49:51,455 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:51,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:49:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-18 19:49:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-18 19:49:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.7671232876712328) internal successors, (129), 73 states have internal predecessors, (129), 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-18 19:49:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 129 transitions. [2022-11-18 19:49:51,459 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 129 transitions. Word has length 12 [2022-11-18 19:49:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:51,460 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 129 transitions. [2022-11-18 19:49:51,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-18 19:49:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 129 transitions. [2022-11-18 19:49:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:49:51,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:51,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:51,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:49:51,461 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:51,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1219048296, now seen corresponding path program 1 times [2022-11-18 19:49:51,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:51,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942117466] [2022-11-18 19:49:51,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:51,795 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-18 19:49:51,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:51,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942117466] [2022-11-18 19:49:51,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942117466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:51,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:51,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:49:51,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79927830] [2022-11-18 19:49:51,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:51,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:49:51,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:51,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:49:51,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:49:51,797 INFO L87 Difference]: Start difference. First operand 74 states and 129 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-18 19:49:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:51,874 INFO L93 Difference]: Finished difference Result 46 states and 73 transitions. [2022-11-18 19:49:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:49:51,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-18 19:49:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:51,876 INFO L225 Difference]: With dead ends: 46 [2022-11-18 19:49:51,876 INFO L226 Difference]: Without dead ends: 46 [2022-11-18 19:49:51,876 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-18 19:49:51,877 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:51,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:49:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-18 19:49:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-18 19:49:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 45 states have internal predecessors, (73), 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-18 19:49:51,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2022-11-18 19:49:51,881 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 14 [2022-11-18 19:49:51,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:51,881 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2022-11-18 19:49:51,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-18 19:49:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2022-11-18 19:49:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:49:51,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:51,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:51,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:49:51,883 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1072660780, now seen corresponding path program 1 times [2022-11-18 19:49:51,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:51,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881459371] [2022-11-18 19:49:51,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:51,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:52,251 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-18 19:49:52,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:52,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881459371] [2022-11-18 19:49:52,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881459371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:52,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:52,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:49:52,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074369261] [2022-11-18 19:49:52,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:52,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:49:52,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:52,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:49:52,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:49:52,255 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-18 19:49:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:52,420 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-11-18 19:49:52,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:49:52,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-18 19:49:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:52,422 INFO L225 Difference]: With dead ends: 61 [2022-11-18 19:49:52,422 INFO L226 Difference]: Without dead ends: 42 [2022-11-18 19:49:52,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:49:52,423 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:52,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:49:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-18 19:49:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-11-18 19:49:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 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-18 19:49:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2022-11-18 19:49:52,426 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 17 [2022-11-18 19:49:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:52,426 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2022-11-18 19:49:52,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-18 19:49:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2022-11-18 19:49:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:49:52,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:52,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:52,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:49:52,428 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:52,429 INFO L85 PathProgramCache]: Analyzing trace with hash -152708414, now seen corresponding path program 2 times [2022-11-18 19:49:52,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:52,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636470531] [2022-11-18 19:49:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:52,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:49:52,762 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-18 19:49:52,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:49:52,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636470531] [2022-11-18 19:49:52,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636470531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:49:52,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:49:52,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:49:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32721826] [2022-11-18 19:49:52,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:49:52,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:49:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:49:52,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:49:52,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:49:52,767 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-18 19:49:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:49:52,934 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2022-11-18 19:49:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:49:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-18 19:49:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:49:52,936 INFO L225 Difference]: With dead ends: 51 [2022-11-18 19:49:52,936 INFO L226 Difference]: Without dead ends: 26 [2022-11-18 19:49:52,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:49:52,937 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:49:52,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:49:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-18 19:49:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-18 19:49:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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-18 19:49:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-18 19:49:52,939 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2022-11-18 19:49:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:49:52,940 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-18 19:49:52,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-18 19:49:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-11-18 19:49:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:49:52,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:49:52,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:52,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:49:52,941 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:49:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:49:52,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1425142460, now seen corresponding path program 3 times [2022-11-18 19:49:52,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:49:52,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236195962] [2022-11-18 19:49:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:49:52,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:49:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:49:53,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:49:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:49:53,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:49:53,244 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:49:53,246 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-18 19:49:53,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-18 19:49:53,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-18 19:49:53,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-18 19:49:53,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-18 19:49:53,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-18 19:49:53,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-18 19:49:53,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-18 19:49:53,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-18 19:49:53,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-18 19:49:53,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:49:53,255 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:49:53,263 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:49:53,263 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:49:53,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:49:53 BasicIcfg [2022-11-18 19:49:53,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:49:53,348 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:49:53,348 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:49:53,348 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:49:53,349 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:49:40" (3/4) ... [2022-11-18 19:49:53,353 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 19:49:53,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:49:53,354 INFO L158 Benchmark]: Toolchain (without parser) took 15765.20ms. Allocated memory was 111.1MB in the beginning and 195.0MB in the end (delta: 83.9MB). Free memory was 74.6MB in the beginning and 135.0MB in the end (delta: -60.4MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2022-11-18 19:49:53,354 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 111.1MB. Free memory was 84.4MB in the beginning and 84.4MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:49:53,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 990.85ms. Allocated memory is still 111.1MB. Free memory was 74.4MB in the beginning and 70.9MB in the end (delta: 3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:49:53,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.41ms. Allocated memory is still 111.1MB. Free memory was 70.9MB in the beginning and 68.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 19:49:53,362 INFO L158 Benchmark]: Boogie Preprocessor took 84.35ms. Allocated memory is still 111.1MB. Free memory was 68.2MB in the beginning and 66.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:49:53,363 INFO L158 Benchmark]: RCFGBuilder took 1298.16ms. Allocated memory is still 111.1MB. Free memory was 66.7MB in the beginning and 77.0MB in the end (delta: -10.4MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2022-11-18 19:49:53,364 INFO L158 Benchmark]: TraceAbstraction took 13253.81ms. Allocated memory was 111.1MB in the beginning and 195.0MB in the end (delta: 83.9MB). Free memory was 76.4MB in the beginning and 135.0MB in the end (delta: -58.6MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2022-11-18 19:49:53,365 INFO L158 Benchmark]: Witness Printer took 5.29ms. Allocated memory is still 195.0MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:49:53,368 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.42ms. Allocated memory is still 111.1MB. Free memory was 84.4MB in the beginning and 84.4MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 990.85ms. Allocated memory is still 111.1MB. Free memory was 74.4MB in the beginning and 70.9MB in the end (delta: 3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.41ms. Allocated memory is still 111.1MB. Free memory was 70.9MB in the beginning and 68.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.35ms. Allocated memory is still 111.1MB. Free memory was 68.2MB in the beginning and 66.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1298.16ms. Allocated memory is still 111.1MB. Free memory was 66.7MB in the beginning and 77.0MB in the end (delta: -10.4MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13253.81ms. Allocated memory was 111.1MB in the beginning and 195.0MB in the end (delta: 83.9MB). Free memory was 76.4MB in the beginning and 135.0MB in the end (delta: -58.6MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Witness Printer took 5.29ms. Allocated memory is still 195.0MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 111 PlacesBefore, 33 PlacesAfterwards, 106 TransitionsBefore, 27 TransitionsAfterwards, 1340 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 3661 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1796, independent: 1659, independent conditional: 0, independent unconditional: 1659, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 951, independent: 914, independent conditional: 0, independent unconditional: 914, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 951, independent: 902, independent conditional: 0, independent unconditional: 902, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 515, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 489, dependent conditional: 0, dependent unconditional: 489, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1796, independent: 745, independent conditional: 0, independent unconditional: 745, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 951, unknown conditional: 0, unknown unconditional: 951] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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: [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L734] 0 int y$w_buff0; [L736] 0 int y$w_buff1; [L711] 0 int __unbuffered_p0_EAX = 0; [L728] 0 _Bool y$r_buff0_thd2; [L725] 0 int y$mem_tmp; [L715] 0 int __unbuffered_p1_EAX = 0; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$read_delayed; [L709] 0 int __unbuffered_cnt = 0; [L724] 0 _Bool y$flush_delayed; [L713] 0 int __unbuffered_p0_EBX = 0; [L737] 0 _Bool y$w_buff1_used; [L719] 0 _Bool main$tmp_guard1; [L718] 0 _Bool main$tmp_guard0; [L717] 0 int __unbuffered_p1_EBX = 0; [L733] 0 int *y$read_delayed_var; [L735] 0 _Bool y$w_buff0_used; [L721] 0 int x = 0; [L729] 0 _Bool y$r_buff1_thd0; [L723] 0 int y = 0; [L731] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$r_buff1_thd1; [L826] 0 pthread_t t1723; [L827] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1723, ((void *)0), P0, ((void *)0))=6, t1723={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t1724; [L829] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1724, ((void *)0), P1, ((void *)0))=7, t1723={5:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: 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 5 procedures, 125 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 555 IncrementalHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 27 mSDtfsCounter, 555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=4, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 131 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 753 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-18 19:49:53,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro --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 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e --- 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-8393723 [2022-11-18 19:49:56,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:49:56,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:49:56,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:49:56,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:49:56,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:49:56,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:49:56,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:49:56,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:49:56,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:49:56,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:49:56,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:49:56,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:49:56,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:49:56,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:49:56,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:49:56,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:49:56,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:49:56,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:49:56,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:49:56,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:49:56,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:49:56,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:49:56,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:49:56,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:49:56,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:49:56,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:49:56,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:49:56,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:49:56,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:49:56,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:49:56,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:49:56,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:49:56,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:49:56,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:49:56,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:49:56,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:49:56,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:49:56,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:49:56,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:49:56,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:49:56,358 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 19:49:56,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:49:56,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:49:56,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:49:56,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:49:56,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:49:56,405 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:49:56,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:49:56,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:49:56,408 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:49:56,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:49:56,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:49:56,410 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:49:56,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:49:56,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:49:56,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:49:56,412 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 19:49:56,412 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 19:49:56,413 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 19:49:56,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:49:56,413 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:49:56,414 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 19:49:56,414 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 19:49:56,414 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:49:56,415 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:49:56,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:49:56,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:49:56,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:49:56,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:49:56,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:49:56,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:49:56,418 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 19:49:56,418 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 19:49:56,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 19:49:56,419 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_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro 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 -> 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e [2022-11-18 19:49:56,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:49:56,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:49:56,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:49:56,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:49:56,974 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:49:56,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-18 19:49:57,048 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/data/0682313fd/e484413f97944676a969e351dbb7ac98/FLAGfa49d091f [2022-11-18 19:49:57,738 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:49:57,747 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-18 19:49:57,766 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/data/0682313fd/e484413f97944676a969e351dbb7ac98/FLAGfa49d091f [2022-11-18 19:49:57,954 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/data/0682313fd/e484413f97944676a969e351dbb7ac98 [2022-11-18 19:49:57,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:49:57,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:49:57,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:49:57,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:49:57,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:49:57,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:49:57" (1/1) ... [2022-11-18 19:49:57,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@751d2f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:57, skipping insertion in model container [2022-11-18 19:49:57,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:49:57" (1/1) ... [2022-11-18 19:49:57,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:49:58,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:49:58,377 WARN L234 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_59953d96-ebb1-4d7c-b854-f096d42f0295/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-18 19:49:58,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:49:58,760 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:49:58,775 WARN L234 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_59953d96-ebb1-4d7c-b854-f096d42f0295/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-18 19:49:58,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:49:58,870 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:49:58,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58 WrapperNode [2022-11-18 19:49:58,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:49:58,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:49:58,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:49:58,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:49:58,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (1/1) ... [2022-11-18 19:49:58,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (1/1) ... [2022-11-18 19:49:58,983 INFO L138 Inliner]: procedures = 178, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2022-11-18 19:49:58,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:49:58,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:49:58,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:49:58,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:49:59,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (1/1) ... [2022-11-18 19:49:59,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (1/1) ... [2022-11-18 19:49:59,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (1/1) ... [2022-11-18 19:49:59,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (1/1) ... [2022-11-18 19:49:59,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (1/1) ... [2022-11-18 19:49:59,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (1/1) ... [2022-11-18 19:49:59,052 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (1/1) ... [2022-11-18 19:49:59,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (1/1) ... [2022-11-18 19:49:59,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:49:59,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:49:59,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:49:59,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:49:59,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (1/1) ... [2022-11-18 19:49:59,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:49:59,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:49:59,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:49:59,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:49:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:49:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:49:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:49:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:49:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 19:49:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 19:49:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:49:59,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:49:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:49:59,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:49:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:49:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:49:59,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:49:59,194 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:49:59,496 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:49:59,499 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:50:00,058 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:50:00,249 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:50:00,250 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:50:00,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:50:00 BoogieIcfgContainer [2022-11-18 19:50:00,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:50:00,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:50:00,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:50:00,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:50:00,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:49:57" (1/3) ... [2022-11-18 19:50:00,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1979e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:50:00, skipping insertion in model container [2022-11-18 19:50:00,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:49:58" (2/3) ... [2022-11-18 19:50:00,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1979e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:50:00, skipping insertion in model container [2022-11-18 19:50:00,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:50:00" (3/3) ... [2022-11-18 19:50:00,264 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2022-11-18 19:50:00,287 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:50:00,288 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-18 19:50:00,288 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:50:00,366 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:50:00,406 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 19:50:00,421 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 107 transitions, 224 flow [2022-11-18 19:50:00,424 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 107 transitions, 224 flow [2022-11-18 19:50:00,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 224 flow [2022-11-18 19:50:00,498 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-11-18 19:50:00,499 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:50:00,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2022-11-18 19:50:00,508 INFO L119 LiptonReduction]: Number of co-enabled transitions 1340 [2022-11-18 19:50:09,252 INFO L134 LiptonReduction]: Checked pairs total: 3423 [2022-11-18 19:50:09,252 INFO L136 LiptonReduction]: Total number of compositions: 110 [2022-11-18 19:50:09,262 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 27 transitions, 64 flow [2022-11-18 19:50:09,308 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 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-18 19:50:09,338 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:50:09,347 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;@67843c16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:50:09,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-18 19:50:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 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-18 19:50:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 19:50:09,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:09,362 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 19:50:09,363 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:50:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:09,376 INFO L85 PathProgramCache]: Analyzing trace with hash 497, now seen corresponding path program 1 times [2022-11-18 19:50:09,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:50:09,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643624364] [2022-11-18 19:50:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:09,392 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-18 19:50:09,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:50:09,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:09,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:09,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 19:50:09,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:09,511 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-18 19:50:09,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:50:09,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:50:09,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643624364] [2022-11-18 19:50:09,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643624364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:09,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:09,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 19:50:09,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314007212] [2022-11-18 19:50:09,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:09,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:50:09,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:50:09,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:50:09,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:50:09,549 INFO L87 Difference]: Start difference. First operand has 244 states, 235 states have (on average 2.6425531914893616) internal successors, (621), 243 states have internal predecessors, (621), 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-18 19:50:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:09,683 INFO L93 Difference]: Finished difference Result 232 states and 566 transitions. [2022-11-18 19:50:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:50:09,689 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-18 19:50:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:09,720 INFO L225 Difference]: With dead ends: 232 [2022-11-18 19:50:09,734 INFO L226 Difference]: Without dead ends: 232 [2022-11-18 19:50:09,736 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-18 19:50:09,740 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:09,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:50:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-18 19:50:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-11-18 19:50:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 2.4933920704845813) internal successors, (566), 231 states have internal predecessors, (566), 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-18 19:50:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 566 transitions. [2022-11-18 19:50:09,822 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 566 transitions. Word has length 1 [2022-11-18 19:50:09,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:09,822 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 566 transitions. [2022-11-18 19:50:09,823 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-18 19:50:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 566 transitions. [2022-11-18 19:50:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 19:50:09,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:09,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 19:50:09,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:10,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:10,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:50:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash 469081327, now seen corresponding path program 1 times [2022-11-18 19:50:10,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:50:10,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089452123] [2022-11-18 19:50:10,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:10,042 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-18 19:50:10,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:50:10,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:10,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:10,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:50:10,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:10,179 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-18 19:50:10,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:50:10,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:50:10,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089452123] [2022-11-18 19:50:10,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089452123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:10,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:10,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 19:50:10,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648633742] [2022-11-18 19:50:10,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:10,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:50:10,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:50:10,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:50:10,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:50:10,184 INFO L87 Difference]: Start difference. First operand 232 states and 566 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-18 19:50:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:10,291 INFO L93 Difference]: Finished difference Result 197 states and 473 transitions. [2022-11-18 19:50:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:50:10,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-18 19:50:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:10,295 INFO L225 Difference]: With dead ends: 197 [2022-11-18 19:50:10,295 INFO L226 Difference]: Without dead ends: 192 [2022-11-18 19:50:10,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-18 19:50:10,297 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:10,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:50:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-18 19:50:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-18 19:50:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.442105263157895) internal successors, (464), 191 states have internal predecessors, (464), 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-18 19:50:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 464 transitions. [2022-11-18 19:50:10,325 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 464 transitions. Word has length 5 [2022-11-18 19:50:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:10,325 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 464 transitions. [2022-11-18 19:50:10,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-18 19:50:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 464 transitions. [2022-11-18 19:50:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 19:50:10,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:10,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:10,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:10,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:10,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:50:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1419685251, now seen corresponding path program 1 times [2022-11-18 19:50:10,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:50:10,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143122311] [2022-11-18 19:50:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:10,549 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-18 19:50:10,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:50:10,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:10,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:10,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:50:10,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:10,692 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-18 19:50:10,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:50:10,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:50:10,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143122311] [2022-11-18 19:50:10,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143122311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:10,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:10,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:50:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019122002] [2022-11-18 19:50:10,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:10,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:50:10,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:50:10,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:50:10,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:50:10,697 INFO L87 Difference]: Start difference. First operand 192 states and 464 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-18 19:50:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:10,786 INFO L93 Difference]: Finished difference Result 92 states and 164 transitions. [2022-11-18 19:50:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:50:10,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-11-18 19:50:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:10,789 INFO L225 Difference]: With dead ends: 92 [2022-11-18 19:50:10,789 INFO L226 Difference]: Without dead ends: 92 [2022-11-18 19:50:10,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-18 19:50:10,791 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 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-18 19:50:10,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:50:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-18 19:50:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-18 19:50:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.8222222222222222) internal successors, (164), 91 states have internal predecessors, (164), 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-18 19:50:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2022-11-18 19:50:10,803 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 8 [2022-11-18 19:50:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:10,803 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2022-11-18 19:50:10,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-18 19:50:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2022-11-18 19:50:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 19:50:10,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:10,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:10,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:11,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:11,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:50:11,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:11,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1887214941, now seen corresponding path program 1 times [2022-11-18 19:50:11,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:50:11,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726600898] [2022-11-18 19:50:11,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:11,030 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-18 19:50:11,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:50:11,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:11,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:11,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:50:11,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:11,233 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-18 19:50:11,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:50:11,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:50:11,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726600898] [2022-11-18 19:50:11,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726600898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:11,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:11,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:50:11,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668628533] [2022-11-18 19:50:11,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:11,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:11,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:50:11,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:11,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:11,238 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand has 4 states, 4 states have (on average 3.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-18 19:50:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:11,358 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2022-11-18 19:50:11,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:50:11,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.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-18 19:50:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:11,360 INFO L225 Difference]: With dead ends: 47 [2022-11-18 19:50:11,360 INFO L226 Difference]: Without dead ends: 47 [2022-11-18 19:50:11,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:11,361 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:11,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:50:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-18 19:50:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-18 19:50:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 46 states have internal predecessors, (74), 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-18 19:50:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2022-11-18 19:50:11,368 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 12 [2022-11-18 19:50:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:11,369 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2022-11-18 19:50:11,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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-18 19:50:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2022-11-18 19:50:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:50:11,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:11,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:11,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:11,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:11,571 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:50:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:11,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1684932657, now seen corresponding path program 1 times [2022-11-18 19:50:11,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:50:11,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343156854] [2022-11-18 19:50:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:11,573 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-18 19:50:11,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:50:11,574 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:11,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:11,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:50:11,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:11,874 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-18 19:50:11,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:50:11,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:50:11,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343156854] [2022-11-18 19:50:11,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343156854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:11,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:11,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:50:11,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599021330] [2022-11-18 19:50:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:11,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:50:11,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:50:11,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:50:11,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:50:11,878 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-18 19:50:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:12,081 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2022-11-18 19:50:12,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:50:12,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-18 19:50:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:12,083 INFO L225 Difference]: With dead ends: 63 [2022-11-18 19:50:12,083 INFO L226 Difference]: Without dead ends: 63 [2022-11-18 19:50:12,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:50:12,085 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:12,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:50:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-18 19:50:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-11-18 19:50:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 61 states have internal predecessors, (95), 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-18 19:50:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2022-11-18 19:50:12,105 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 17 [2022-11-18 19:50:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:12,105 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2022-11-18 19:50:12,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-18 19:50:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2022-11-18 19:50:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:50:12,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:12,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:12,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:12,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:12,308 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:50:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:12,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1684932642, now seen corresponding path program 1 times [2022-11-18 19:50:12,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:50:12,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435515815] [2022-11-18 19:50:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:50:12,309 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-18 19:50:12,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:50:12,311 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:12,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:50:12,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 19:50:12,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:12,846 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-18 19:50:12,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:50:12,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:50:12,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435515815] [2022-11-18 19:50:12,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435515815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:12,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:12,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:50:12,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451049617] [2022-11-18 19:50:12,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:12,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:50:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:12,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:12,852 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:12,911 INFO L93 Difference]: Finished difference Result 93 states and 143 transitions. [2022-11-18 19:50:12,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:50:12,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:12,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:12,913 INFO L225 Difference]: With dead ends: 93 [2022-11-18 19:50:12,913 INFO L226 Difference]: Without dead ends: 82 [2022-11-18 19:50:12,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:12,917 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:12,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-11-18 19:50:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-18 19:50:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 61. [2022-11-18 19:50:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.576271186440678) internal successors, (93), 60 states have internal predecessors, (93), 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-18 19:50:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2022-11-18 19:50:12,943 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 17 [2022-11-18 19:50:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:12,944 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2022-11-18 19:50:12,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:12,945 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2022-11-18 19:50:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:50:12,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:12,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:12,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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)] Ended with exit code 0 [2022-11-18 19:50:13,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:13,166 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:50:13,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:13,167 INFO L85 PathProgramCache]: Analyzing trace with hash -37768850, now seen corresponding path program 2 times [2022-11-18 19:50:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:50:13,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123835897] [2022-11-18 19:50:13,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:50:13,168 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-18 19:50:13,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:50:13,169 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:13,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:13,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 19:50:13,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:50:13,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 19:50:13,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:13,601 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-18 19:50:13,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:50:13,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:50:13,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123835897] [2022-11-18 19:50:13,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123835897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:13,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:13,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:50:13,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836493238] [2022-11-18 19:50:13,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:13,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:13,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:50:13,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:13,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:13,604 INFO L87 Difference]: Start difference. First operand 61 states and 93 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:13,633 INFO L93 Difference]: Finished difference Result 92 states and 141 transitions. [2022-11-18 19:50:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:50:13,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:13,635 INFO L225 Difference]: With dead ends: 92 [2022-11-18 19:50:13,635 INFO L226 Difference]: Without dead ends: 74 [2022-11-18 19:50:13,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:13,636 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:13,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-11-18 19:50:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-18 19:50:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2022-11-18 19:50:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 59 states have internal predecessors, (91), 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-18 19:50:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2022-11-18 19:50:13,640 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 17 [2022-11-18 19:50:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:13,640 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2022-11-18 19:50:13,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2022-11-18 19:50:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:50:13,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:13,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:13,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-18 19:50:13,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:13,842 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:50:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash -274837218, now seen corresponding path program 3 times [2022-11-18 19:50:13,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:50:13,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841864284] [2022-11-18 19:50:13,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:50:13,843 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-18 19:50:13,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:50:13,844 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:13,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:13,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-18 19:50:13,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:50:14,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 19:50:14,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:14,204 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-18 19:50:14,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:50:14,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:50:14,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841864284] [2022-11-18 19:50:14,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841864284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:14,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:14,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:50:14,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969725103] [2022-11-18 19:50:14,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:14,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:50:14,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:14,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:14,206 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:14,240 INFO L93 Difference]: Finished difference Result 91 states and 139 transitions. [2022-11-18 19:50:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:50:14,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:14,241 INFO L225 Difference]: With dead ends: 91 [2022-11-18 19:50:14,242 INFO L226 Difference]: Without dead ends: 58 [2022-11-18 19:50:14,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:14,242 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:14,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-11-18 19:50:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-18 19:50:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-18 19:50:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 57 states have internal predecessors, (87), 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-18 19:50:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2022-11-18 19:50:14,247 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 17 [2022-11-18 19:50:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:14,248 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2022-11-18 19:50:14,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2022-11-18 19:50:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:50:14,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:14,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:14,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:14,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:14,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:50:14,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash 288474078, now seen corresponding path program 4 times [2022-11-18 19:50:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:50:14,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724323415] [2022-11-18 19:50:14,451 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 19:50:14,451 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-18 19:50:14,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:50:14,452 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:14,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:14,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 19:50:14,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:50:14,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 19:50:14,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:50:14,823 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-18 19:50:14,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:50:14,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:50:14,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724323415] [2022-11-18 19:50:14,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724323415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:50:14,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:50:14,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:50:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688379657] [2022-11-18 19:50:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:50:14,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:50:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:50:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:50:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:14,826 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:50:14,842 INFO L93 Difference]: Finished difference Result 57 states and 85 transitions. [2022-11-18 19:50:14,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:50:14,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:50:14,844 INFO L225 Difference]: With dead ends: 57 [2022-11-18 19:50:14,844 INFO L226 Difference]: Without dead ends: 26 [2022-11-18 19:50:14,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:50:14,845 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:50:14,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-11-18 19:50:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-18 19:50:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-18 19:50:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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-18 19:50:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-18 19:50:14,848 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2022-11-18 19:50:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:50:14,848 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-18 19:50:14,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-18 19:50:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-11-18 19:50:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:50:14,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:50:14,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:50:14,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:15,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:15,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-18 19:50:15,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:50:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1267934095, now seen corresponding path program 2 times [2022-11-18 19:50:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:50:15,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783136942] [2022-11-18 19:50:15,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:50:15,061 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-18 19:50:15,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:50:15,062 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:15,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:15,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 19:50:15,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 19:50:15,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:50:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:50:15,358 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-18 19:50:15,358 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:50:15,359 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-18 19:50:15,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-18 19:50:15,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-18 19:50:15,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-18 19:50:15,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-18 19:50:15,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-18 19:50:15,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-18 19:50:15,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-18 19:50:15,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-18 19:50:15,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-18 19:50:15,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:15,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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-18 19:50:15,575 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2022-11-18 19:50:15,580 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:50:15,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:50:15,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:50:15 BasicIcfg [2022-11-18 19:50:15,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:50:15,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:50:15,646 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:50:15,646 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:50:15,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:50:00" (3/4) ... [2022-11-18 19:50:15,649 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 19:50:15,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:50:15,650 INFO L158 Benchmark]: Toolchain (without parser) took 17689.64ms. Allocated memory was 56.6MB in the beginning and 107.0MB in the end (delta: 50.3MB). Free memory was 33.5MB in the beginning and 46.7MB in the end (delta: -13.2MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2022-11-18 19:50:15,650 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 56.6MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:50:15,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 906.45ms. Allocated memory is still 56.6MB. Free memory was 33.3MB in the beginning and 26.4MB in the end (delta: 6.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 19:50:15,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.55ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 26.2MB in the beginning and 58.1MB in the end (delta: -31.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-11-18 19:50:15,651 INFO L158 Benchmark]: Boogie Preprocessor took 77.37ms. Allocated memory is still 75.5MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:50:15,652 INFO L158 Benchmark]: RCFGBuilder took 1189.77ms. Allocated memory is still 75.5MB. Free memory was 56.0MB in the beginning and 54.4MB in the end (delta: 1.6MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-11-18 19:50:15,652 INFO L158 Benchmark]: TraceAbstraction took 15389.20ms. Allocated memory was 75.5MB in the beginning and 107.0MB in the end (delta: 31.5MB). Free memory was 53.7MB in the beginning and 46.7MB in the end (delta: 7.0MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2022-11-18 19:50:15,653 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 107.0MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:50:15,654 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.34ms. Allocated memory is still 56.6MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 906.45ms. Allocated memory is still 56.6MB. Free memory was 33.3MB in the beginning and 26.4MB in the end (delta: 6.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.55ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 26.2MB in the beginning and 58.1MB in the end (delta: -31.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.37ms. Allocated memory is still 75.5MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1189.77ms. Allocated memory is still 75.5MB. Free memory was 56.0MB in the beginning and 54.4MB in the end (delta: 1.6MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15389.20ms. Allocated memory was 75.5MB in the beginning and 107.0MB in the end (delta: 31.5MB). Free memory was 53.7MB in the beginning and 46.7MB in the end (delta: 7.0MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 107.0MB. Free memory is still 46.7MB. 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: 8.8s, 112 PlacesBefore, 33 PlacesAfterwards, 107 TransitionsBefore, 27 TransitionsAfterwards, 1340 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 3423 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1757, independent: 1638, independent conditional: 0, independent unconditional: 1638, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 958, independent: 922, independent conditional: 0, independent unconditional: 922, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 958, independent: 910, independent conditional: 0, independent unconditional: 910, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 383, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 359, dependent conditional: 0, dependent unconditional: 359, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1757, independent: 716, independent conditional: 0, independent unconditional: 716, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 958, unknown conditional: 0, unknown unconditional: 958] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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: [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L734] 0 int y$w_buff0; [L736] 0 int y$w_buff1; [L711] 0 int __unbuffered_p0_EAX = 0; [L728] 0 _Bool y$r_buff0_thd2; [L725] 0 int y$mem_tmp; [L715] 0 int __unbuffered_p1_EAX = 0; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$read_delayed; [L709] 0 int __unbuffered_cnt = 0; [L724] 0 _Bool y$flush_delayed; [L713] 0 int __unbuffered_p0_EBX = 0; [L737] 0 _Bool y$w_buff1_used; [L719] 0 _Bool main$tmp_guard1; [L718] 0 _Bool main$tmp_guard0; [L717] 0 int __unbuffered_p1_EBX = 0; [L733] 0 int *y$read_delayed_var; [L735] 0 _Bool y$w_buff0_used; [L721] 0 int x = 0; [L729] 0 _Bool y$r_buff1_thd0; [L723] 0 int y = 0; [L731] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$r_buff1_thd1; [L826] 0 pthread_t t1723; [L827] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1723, ((void *)0), P0, ((void *)0))=0, t1723={515:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t1724; [L829] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1724, ((void *)0), P1, ((void *)0))=1, t1723={515:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={515:0}, t1724={3:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: 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 5 procedures, 126 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 68 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 258 IncrementalHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 22 mSDtfsCounter, 258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=0, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 36 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 102 ConstructedInterpolants, 47 QuantifiedInterpolants, 1430 SizeOfPredicates, 11 NumberOfNonLiveVariables, 999 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 19:50:15,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59953d96-ebb1-4d7c-b854-f096d42f0295/bin/uautomizer-TMbwUNV5ro/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